In physical terms, the interaction between a pair of assemblies, A and B, will depend on the number and size of the subassemblies (including the subsubassemblies) that they have in common. This set of subassemblies could be called the “inte…Let $E1, E2, \dots, En$ represent events or propositions. Let the probability $P(E1 \cdot \bar{E}2 \cdot \dots \cdot En)$, for example, where the vinculum denotes negation, be denoted by $p{10\dots1}$, where 0 means false and 1 means true. …
George Boole
mathematician · 2 mentions across 1 reading
In this course
George Boole, the 19th-century mathematician who formalized logic as an algebraic system, provides the foundational notation for treating propositions and events as computable entities—operations like intersection (A.B) and negation that became essential to cybernetic and information-theoretic thinking. In these readings, Boolean logic enables the description of complex systems (assemblies with shared subcomponents, probability distributions over propositions) as discrete, manipulable structures, making it possible to reason about neural networks, feedback loops, and artificial reasoning in precise mathematical terms. His framework essentially made logic machine-readable before machines existed to read it.
Mentioned in 1 reading
Appears alongside
People mentioned in the same passages — sorted by co-occurrence weight.