Boolean algebra
An algebra developed by George Boole in which operations on sets and truth values (true/false) follow specific mathematical rules, underpinning logic and digital circuits.
As defined in 343 | Tom Griffiths on The Laws of Thought
Where it comes up · 3
- 304 - Why I Left Twitter2 claims
- #92 Ed Thorp and Claude Shannon1 claim
- 343 | Tom Griffiths on The Laws of Thought1 claim
Most important claims · 4 of 4Search all claims for “Boolean algebra” →
- Claude Shannon's master's thesis—recognizing that electronic relay switches in the AT&T phone system could implement propositional logic expressed in Boolean algebra as a circuit—was probably the most important single idea enabling the move from analog to digital computation, and had he not written it the breakthrough would likely have been delayed only a couple of years.304 - Why I Left Twitter
- George Boole succeeded where Leibniz failed because he recognized it was not arithmetic but a different algebra that was needed; in his book the first half formalizes logic by treating sets with operations (e.g., X times Y as the intersection of sets X and Y) and the second half develops probability theory.343 | Tom Griffiths on The Laws of Thought
- Shannon realized that encoding Boolean logic (true/false, and, or, not, if) in electrical circuits meant any logical relationship could be built from these elements, proving an electrical digital computer could compute anything.#92 Ed Thorp and Claude Shannon
- Despite his foundational mathematical work, Turing gets too much credit for modern digital computing; the engineering revolution producing digital computers could have happened easily without him, driven by World War II momentum and a thriving analog computation industry—Turing became more useful to theoretical computer scientists starting in the 1960s rather than to the engineering of computers themselves.304 - Why I Left Twitter