//section (11.1) personal note

**Definitions:**

**The Boolean compliment:**

__ __

The negation of a Boolean. Denoted as 1 or 0. Spoken as 1(bar) and 0(bar).

0(bar) = 1

1(bar) = 0

**Boolean Addition:**

This works exactly like the logical operator OR.

0+0 = 0

0+1= 1

1+0= 1

1+1 =1

**Boolean Multiplication:**

This works exactly like the logical operator AND.

0*0 = 0

0*1 = 0

1*0 = 0

1*1 = 1

As you can see zeros dominate in any multiplication

**Example:**

__

1 *(0+1) = 0 * 1 = 0

(1+1)+(1+0) = 1 + 1 = 1

Very informative and useful in computer science applications! I had to learn this last year for my IB computer science exam. Awesome stuff!

ReplyDeleteAre you in the Games Design business? Are you in any business?

ReplyDeleteTry matrices with this

ReplyDeleteThis stuff seems pretty easy but it probably gets crazy when the numbers get huge!

ReplyDeleteThis stuff just goes completely over my head

ReplyDeletePost = true;

ReplyDelete:D

Very informative! just being supportive!

ReplyDeletein c you can do this wonderful thing

ReplyDelete#define TRUE FALSE

which will pretty mindfuck every other guy working on the same project :3

Dude, you seem to really know your stuff :D

ReplyDeleteI'm going to be taking a course in computing soon so I need to get used to things like this. Please check out my blog!

very interesting

ReplyDeleteIt is amazing computers can do all they do with 100% toggle switches (on off). It is mind blowing

ReplyDelete