A card from a free library — ask anything, no account, works offline. Every card carries its source.
Logic gates — the 16 functions of two inputs
computer science
Of two inputs there are exactly 2^(2^2) = 16 Boolean functions (sealed) - AND, OR, XOR, NAND and the rest; NAND alone builds them all. From gates come adders, memory and processors. All computation is wired from this finite logic. The algebra the gates are functions in is George Boole's - An Investigation of the Laws of Thought (1854), two values and one law of their own, x*x = x, which Boole named the fundamental law of thought (the law of duality). Rests on the instruments (formal logic) and on Boole.
source
Narrow Highway — computer science
card id
card_cs_logic_gates
address
WIT.codex.FCT/logic-gates-the-16-functions-of-two-inputs/REF.WITNESSED@narrow-highway
adjoining cards
- part of → Computer science — bits, logic, and what can be computed — a pillar of computer science (Logic gates)
- connects at → The instruments — every verifier and validator, and where they join — Boolean logic is the formal-logic instrument - gates from truth functions
- connects at → An Investigation of the Laws of Thought On which are founded the mathematical theories of logic and probabilities — George Boole — Boole 1854 - the two-valued algebra the gates are functions in; x*x = x, the law of dualit
- connects at → Boolean algebra / propositional logic — Boolean algebra / propositional logic - the theory card of the same algebra
- connects at → Sorting algorithms — the roll of eighty-six and the bound none can beat — a comparison is one Boolean decision; the three-way comparison (<, =, >) is the third valu
Is this card incomplete? Tell the library — it will call out for more ↗