324_Book

# Figure 26 denes several operations in this boolean

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ux machines both have Intel processors and hence support the same machine-level instructions. In general, however, the structure of an executable NT program differs from a Linux program, and hence the machines are not fully binary compatible. Binary code is seldom portable across different combinations of machine and operating system. A fundamental concept of computer systems is that a program, from the perspective of the machine, is simply sequences of bytes. The machine has no information about the original source program, except perhaps some auxiliary tables maintained to aid in debugging. We will see this more clearly when we study machine-level programming in Chapter 3. 2.1.7 Boolean Algebras and Rings Since binary values are at the core of how computers encode, store, and manipulate information, a rich body of mathematical knowledge has evolved around the study of the values 0 and 1. This started with the work of George Boole around 1850, and hence goes under the heading of Boolean algebra. Boole observed that by encoding logic values T RUE and FALSE as binary values 1 and 0, he could formulate an algebra that captures the properties of propositional logic. There is an inﬁnite number of different Boolean algebras, where the simplest is deﬁned over the two-element set ¼ ½ . Figure 2.6 deﬁnes several operations in this Boolean algebra. Our symbols for representing these operations are chosen to match those used by t...
View Full Document

## This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.

Ask a homework question - tutors are online