The McCulloch–Pitts neuron is a mathematical model of the neuron as a logical switch: it receives binary signals, counts how many excitatory inputs are active, and “fires” if that number reaches a threshold. Warren McCulloch and Walter Pitts proposed it in 1943 not as a blueprint for a machine but as a theory of how nervous tissue could do logic (McCulloch & Pitts, 1943; Mollick, 2026).
How it works
The paper starts from five assumptions: neural activity is “all-or-none”; a fixed number of synapses must be excited within a brief period of summation to excite the neuron; the only significant delay is synaptic delay; any active inhibitory synapse absolutely prevents firing; and the structure of the net does not change over time (McCulloch & Pitts, 1943, sec. 2). In today's terms, it is an artificial neuron with all weights equal to 1, a step activation function, and an inhibitory veto.
With two inputs and threshold 2, the unit computes conjunction; with threshold 1, disjunction; inhibition yields negation. Witten et al. (2017) show why one unit suffices for AND, OR and NOT but not for exclusive-or: the first three cases can be separated by a straight line, XOR cannot. XOR is obtained by composing units, as (a ∨ b) ∧ ¬(a ∧ b), and two layers are enough for any propositional formula, which is at bottom the disjunctive normal form (2017, pp. 262–263).
Logic made of neurons
The paper's abstract puts it bluntly: because of the “all-or-none” character of nervous activity, “neural events and the relations among them can be treated by means of propositional logic” (McCulloch & Pitts, 1943). Each neuron corresponds to a proposition (“neuron i fires at time t”), and the notation comes from Carnap's Language II and from Whitehead and Russell's Principia, dots and all (McCulloch & Pitts, 1943, sec. 2). They do not cite Boole, although his algebra (Boole, 1854) is the root of that tradition (Mollick, 2026). As a genealogical footnote, Geoffrey Hinton, one of the fathers of deep learning, is Boole's great-great-grandson (2026).
Nets without circles correspond to propositional formulas with temporal reference. Nets with circles are more interesting: activity can reverberate, which gives memory, and the authors claim that a net furnished with a tape computes exactly the numbers a Turing machine computes, which they take to be a “psychological justification” of Turing's definition (McCulloch & Pitts, 1943, sec. 3). In 1956, Stephen Kleene characterized which sequences of stimuli such nets can recognize and, along the way, invented regular expressions (Kleene, 1956): regular languages, the bottom rung of the hierarchy Chomsky would use against Markov models of English (see n-gram language model), were born from analyzing McCulloch–Pitts neurons.
Limits
The unit does not learn: thresholds and connections are set by whoever designs the net. The next step belonged to Rosenblatt's Perceptron, which added weights adjusted from examples; Buckner (2024) places McCulloch and Pitts at the start of the “first wave” of neural networks precisely because they showed that a simple threshold model could compute basic logical operations (2024, pp. 119–120). The biological assumptions (discrete time, absolute inhibition, binary signals) were strong idealizations even for the neurophysiology of the day.
Still, the idea that complex logical operations can arise from many simple, well-connected components directly inspired both John von Neumann and Frank Rosenblatt; that is, the two traditions that produced the architecture of the digital computer and deep networks (Buckner, 2024, p. 9). For those pioneers, the analogies between computers and brains were strong, and replicating human intelligence in programs seemed obvious (M. Mitchell, 2019, ch. 1); in this model, logic circuit and neuron still coincided.