Boolean Function - Research Article from World of Computer Science

This encyclopedia article consists of approximately 2 pages of information about Boolean Function.

Boolean Function - Research Article from World of Computer Science

This encyclopedia article consists of approximately 2 pages of information about Boolean Function.
This section contains 467 words
(approx. 2 pages at 300 words per page)
Buy the Boolean Function Encyclopedia Article

A Boolean function is a mathematical function that employs Boolean operations. Generally, a function is a computation that accepts an input and produces an output. A Boolean function (or binary function) is an expression that uses connectives such as AND, OR, NOT, NAND, and NOR to produce an output based on two or more Boolean (TRUE/FALSE) inputs. That is, its input is a collection of expressions that are evaluated with regard to their truth or falsity, and its output is either 1 (TRUE) or 0 (FALSE).

Boolean algebra, first proposed by George Boole (1815-1864), provides a mathematical procedure for manipulating logical relations in symbolic form. Boolean variables are confined to two possible states or values. These pairs of values are typically interpreted as YES and NO, ON and OFF, or TRUE and FALSE. In computer science and engineering practice, it is common to employ 1 and 0 as the...

(read more)

This section contains 467 words
(approx. 2 pages at 300 words per page)
Buy the Boolean Function Encyclopedia Article
Copyrights
Gale
Boolean Function from Gale. ©2005-2006 Thomson Gale, a part of the Thomson Corporation. All rights reserved.