Before a network can learn, it must be possible to say what it computes
Paper 0045 treated a trained network as a computation graph whose intermediate values could be retained, released and reproduced. That systems problem presupposed a settled answer to an older question: what kind of object is a neural net, and how can its behaviour be described? Paper 0046 returns to 1943, before the perceptron, gradient descent for deep nets or automatic differentiation. Warren McCulloch and Walter Pitts do not teach a network. They give a deliberately austere network a formal semantics.
The familiar retrospective summary says that McCulloch and Pitts made neurons into logic gates. It is true but incomplete. Static AND, OR and inhibited conjunction are the visible pieces. The deeper construction includes a discrete clock, propagation delay, temporal propositions, a distinction between feed-forward and recurrent structure, and a pair of inverse problems. Given a net, calculate the propositions its neurons satisfy. Given an admissible temporal proposition, construct a net that realises it.
This double direction matters. Analysis alone would say what a mechanism does. Synthesis alone would build a mechanism for a desired relation. Their calculus joins the two. It also exposes underdetermination: indefinitely many differently shaped nets can realise the same temporal expression. Behaviour therefore identifies an equivalence class, not a unique anatomy.
The paper then reaches far beyond circuit construction. It links recurrent nets to indefinitely remote history, places augmented nets against Turing computability, and draws consequences for perception, causality and mind. Those later claims are part of the historical document, but they do not all carry the same evidential force. This companion will keep the formal theorem, the modelling interpretation and the philosophical extension on separate shelves.
Causal probe 1 · What does a formal semantics add to a diagram?
A diagram shows connections, but connections alone do not determine behaviour. A semantics specifies when a node fires, how long signals take, how inhibition acts and how state advances. Once those rules are explicit, a drawing becomes a calculable machine and two different drawings can be compared by the behaviours they realise.
Worked example 1 · One drawing, two questions
Take two input neurons feeding an output with threshold two. Analysis asks which input histories make the output fire: both inputs must have fired one delay earlier. Synthesis starts from that delayed conjunction and asks for a net: connect both inputs excitatorily to a threshold-two output. The same object answers the questions in opposite directions.
Excitation counts; inhibition has a veto
At each discrete time, an internal neuron receives events produced one synaptic delay earlier. Its excitatory synapses contribute to a count. If that count reaches the neuron’s fixed threshold and no inhibitory synapse is active, the neuron fires. Otherwise it does not. The rule is deterministic, binary and synchronous at the level of the calculus.
This modernised notation compresses the paper’s finite disjunction over all excitatory subsets that meet threshold, conjoined with the negation of every inhibitory input. It must not silently replace the paper’s rule with the weighted-sum neuron familiar from current machine learning. Excitatory contacts are counted, thresholds are integers, and a single active inhibitory contact blocks firing absolutely.
The delay is not an incidental implementation detail. It turns a logical connective into a temporal relation. If input A fires at time 4 and reaches output C through one synapse, C can fire at time 5. A chain of three neurons can represent a proposition about an event three delays earlier. Logic is embedded in succession.
Nor is the model a learning algorithm. The fifth assumption fixes the net’s structure. The later theorem that an alterable synapse can be replaced by a circle shows how a specified change-like behaviour might be simulated by fixed recurrence; it does not supply data, loss, weight updates or a procedure that discovers useful wiring.
Worked example 2 · Absolute veto beats a satisfied threshold
Let a neuron have two excitatory inputs A and B, one inhibitory input H and threshold two. At the previous step A=1, B=1, H=0 produces output 1. Changing only H to 1 produces output 0. The excitatory requirement is met in both cases; inhibition is not a negative weight that merely lowers the sum. It is a separate necessary condition.
Causal probe 2 · Why does one-step delay simplify the theory?
It gives every connection a common unit of time. The next state becomes a function of the preceding state, and a path’s length becomes its delay. Without a common timing convention, the same topology could realise different temporal relations depending on heterogeneous conduction and integration times.
A proposition can point to its predecessor
The paper writes Nᵢ(t) for the proposition that neuron cᵢ fires at time t. Its operator S shifts a property to the predecessor: informally, S[P](t) means P(t−1). Repeating the operator reaches further back. A firing condition can therefore say not only “A and B” but “A one delay ago and not B two delays ago”.
A temporal propositional expression, or TPE, is generated recursively. Delayed predicate variables are allowed. From expressions sharing a time variable, the calculus permits disjunction, conjunction and a form of conjunction with negation. Nothing else enters by fiat. The narrow grammar mirrors the behaviours available to a quiescent, fixed, binary net.
The phrase “temporal logic” can mislead a modern reader. This is not the later modal temporal logic of always, eventually, until and branching time. It is a propositional calculus indexed by discrete predecessor steps. Its importance lies in making network timing algebraic: path length and recurrence become claims about how far into the past an output can depend.
Peripheral afferents serve as the unexplained inputs of a net. Internal neurons are to be solved in terms of them. A solution is a family of sentences equating each internal action with a proposition over afferent actions, initial conditions and time. The description hides the internal route while preserving its input–output law.
Worked example 3 · A path is a delay operator
If A excites B and B excites C, with threshold one at both internal nodes, then B(t)=A(t−1) and C(t)=B(t−1)=A(t−2). Adding another relay does not change the truth value it carries; it changes when that value can affect the output.
Causal probe 3 · Why is timing part of behavioural equivalence?
Two nets can compute the same Boolean mapping but deliver it after different numbers of synaptic delays. Narrow equivalence preserves that timing. Extended equivalence allows a uniform extra delay, treating additional relays as a change of implementation rather than a change of logical capability.
An acyclic net can be substituted away
The paper calls a net cyclic when it contains a directed circle. Its order is the smallest number of neurons whose removal eliminates all circles. An order-zero net is acyclic. This absence of feedback gives Theorem I its terminating procedure: every order-zero net can be solved in temporal propositional expressions.
Start at a chosen internal neuron. Write its firing condition as the disjunction of excitatory subsets sufficient to meet threshold, conjoined with the absence of all inhibitors. Whenever that expression names another internal neuron, replace the name with that neuron’s own firing condition. Because every replacement moves upstream in a finite directed acyclic graph, no internal name can return. Eventually only peripheral afferents and delayed initial conditions remain.
This is structural induction wearing network clothes. A topological order provides a rank that decreases under substitution. The proof does not search arbitrary formula space; it follows wires. The result can grow large: ordinary Boolean expansion may duplicate subexpressions: but finiteness is guaranteed.
Solving a net changes the representation of knowledge. The original diagram explains a mechanism through local interactions. The final expression explains an output through a direct condition on input histories. One is intensional and compositional; the other is extensional over the chosen interface. Both are valuable, and neither uniquely determines the other.
Worked example 4 · Substitute through a fork and merge
Let B(t)=A(t−1), C(t)=A(t−1), and D require B together with not C’s inhibitor at the preceding step. Substitution gives D(t)=A(t−2) ∧ ¬A(t−2), so D never fires. The diagram can look active while the solved proposition reveals a contradiction.
Causal probe 4 · Why does the method fail to finish on a circle?
Substituting a recurrent neuron’s definition eventually reproduces the same neuron at an earlier time. Repeating the step walks without a finite structural bottom. The output may depend on how long the loop has been active and therefore on history beyond any fixed look-back chosen in advance.
A temporal proposition can be wired into a net
Theorem II reverses the direction: every temporal propositional expression in the paper’s grammar is realisable by an order-zero net. The proof begins with a one-neuron realisation of an input proposition and a relay for one predecessor step. Figure 1 then supplies constructions for disjunction, conjunction and conjunction with negation. Composition replaces a primitive’s afferent with the output of a net realising a subexpression.
Induction does the rest. If nets realise P and Q, align their delays by adding relays where necessary, connect them to the appropriate primitive, and obtain a net for P∨Q, P∧Q or P∧¬Q. The additional alignment delay is why extended realisability is convenient. The calculus preserves the relation even if a constructed route takes longer than another.
This is an early compilation story. A formula is a specification; primitive nets are an instruction set; composition is compilation; firing traces are execution. Unlike a modern software compiler, however, the target is an idealised neural topology and the source language is deliberately restricted by what the topology can do from quiescence.
Synthesis also makes non-uniqueness unavoidable. Extra relays, duplicated subcircuits and alternative threshold arrangements can preserve the same expression. Theorem II promises existence, not optimality, anatomical truth or a unique causal explanation. A behavioural law narrows possible mechanisms without selecting one.
Worked example 5 · Build “A or B, then C”
First construct an OR node receiving A and B with threshold one. Feed its output and C into an AND node with threshold two. Because both paths into the final node must refer to the same time, add a relay to C if the OR path contributes an extra delay. The resulting output realises a delayed version of (A∨B)∧C.
Causal probe 5 · Why are delay-alignment relays logically harmless but operationally visible?
A uniform shift leaves which input patterns satisfy the relation unchanged, so extended realisability treats it as equivalent. A physical observer still sees the extra latency. The choice of equivalence therefore encodes which differences the theory considers material.
The all-false row cannot spontaneously become true
The paper does not claim that every arbitrary truth table is directly realised by a quiescent order-zero net. Its TPE grammar has a revealing restriction. If every elementary delayed input proposition is false, the whole permitted expression is false. In an equivalent normal-form statement, no disjunctive term may consist solely of negated inputs.
The reason is physical inside the model. An inactive feed-forward net with no active afferent has no source of excitation. Inhibition can prevent a firing event, but absence itself cannot cross a positive threshold. A pure NOT gate, which would output one when its only input is zero, requires a tonic source, an initial condition or a differently framed construction.
This qualification often disappears from textbook retellings that label the neuron functionally complete. Function completeness can be recovered by adding a constant active input or by using extended constructions, but that additional resource matters. Theorem III characterises exactly what follows from the stated net conventions rather than importing a powered logical gate from electronics.
The restriction is a useful lesson in model reading. A truth table never floats free of its implementation assumptions. What counts as a primitive constant, what state exists before time zero, and whether silence can cause activity all alter the realisable class.
Worked example 6 · Why NOT A needs a source
The table for NOT A has output one when A=0. A positive-threshold neuron receiving only A cannot fire on that row because it receives no excitation. Add a tonic excitatory source T=1 and make A inhibitory: the neuron now fires when T is active and A is absent. The missing ingredient was not Boolean notation but energy represented as constant excitation.
Causal probe 6 · What does the last truth-table row reveal?
It tests whether a claimed output can appear from universal inactivity. If the row is true, a quiescent positive-threshold acyclic net needs some hidden source: initial state, tonic input or recurrence. The row is therefore a compact audit of the model’s causal resources.
Different mechanisms may preserve the same law
McCulloch and Pitts knew their physiological assumptions were contestable. Rather than defend each as uniquely correct, they ask whether changing an assumption changes the class of realisable behaviours. If every behaviour available under one law can also be realised, perhaps by a different net and after a different delay, under another law, the assumptions are equivalent in the chosen sense.
Theorems IV through VII apply this programme. Relative inhibition can substitute for absolute inhibition through suitable circuitry. Extinction can be represented by absolute inhibition. Facilitation and temporal summation can be converted into spatial summation by delay chains and additional synapses. A specified alterable-synapse behaviour can be replaced by a circuit whose recurrent state changes what later inputs can do.
Each replacement spends structure and time. Equivalence is not identity: the substitute may contain more neurons, longer paths and different vulnerabilities. The theorem protects an input–output capacity while deliberately discarding other properties. It is therefore a theorem relative to an observational vocabulary.
This way of reasoning remains current. A compiler replaces one instruction sequence with another that preserves declared semantics. A digital circuit can emulate an analogue relation to a chosen tolerance. A neural architecture can simulate another with extra width or depth. In every case, the decisive question is which observations must remain invariant.
Worked example 7 · Turn temporal summation into spatial summation
Suppose two impulses arriving at one synapse on successive steps should jointly excite a neuron. Split the first impulse through a one-step delay so that its copy arrives beside the second impulse. A threshold-two neuron now sees two simultaneous spatial inputs. The temporal rule has become a larger spatial circuit with added latency.
Causal probe 7 · Why can behavioural equivalence conceal mechanism?
If an observer records only the final output after allowing arbitrary extra delay, every internal replacement that preserves that output is invisible. Measuring intermediate firing, latency, lesion response or energy would refine the observational vocabulary and split one broad equivalence class into smaller ones.
Transient cooling turns a sensation into a temporal pattern
The paper’s concrete example is not a static gate. It considers the report of warmth after a cold object touches the skin briefly and is removed, contrasted with sustained cold that produces no preliminary warmth. Separate heat and cold receptors provide afferent actions; downstream neurons represent the two reported sensations.
The construction depends on duration and order. A warmth-related output can be made responsive to the end of a short cold event: a delayed record says cold was recently present, while current or differently delayed cold inhibits the output if the stimulus persists. A cold-related output follows the continuing cold signal on another timescale.
McCulloch and Pitts write the desired propositions first, then construct from the innermost brackets outwards using their primitive nets. This is the synthesis theorem used as a design method. The example also supports a larger claim: what a net reports about an external event depends on the intervening structure. The same afferent history can be transformed into different internal propositions by different wiring.
The physiology is historically situated and should not be read as a current receptor model. Its teaching value lies elsewhere. It shows that a nervous-net calculus must distinguish a level from a transition, duration from onset, and present input from a delayed trace. A temporal predicate can encode all four.
Worked example 8 · Detect the falling edge of cold
Let C(t) say the cold receptor is active. Define R(t)=C(t−1)∧¬C(t). For the trace 0,1,1,0,0, R is 1 only at the first step after cold disappears. A one-step relay retains C(t−1), while current C inhibits the detector. This is a compact modern analogue of the paper’s transient-pattern logic, not a literal reproduction of its full figure.
A loop turns a bounded look-back into state
For an acyclic net, the longest path from an input to an output bounds how far back the solved proposition must look. Add a directed circle and that bound can disappear. Activity may reverberate around the loop, returning to a neuron after each circuit. A present firing can then depend on whether an initiating event occurred at any of many earlier times.
The paper introduces cyclic sets and the order of a net to measure how much must be removed to break recurrence. Its later theorems use classes of time and periodic structure to characterise recurrent behaviour. The notation is dense, but the conceptual change is clean: a recurrent net cannot generally be replaced by one finite feed-forward formula over a fixed window of input history.
A self-exciting threshold-one neuron gives the simplest memory. Once an external input fires it, its previous firing becomes enough to fire it again. The input can fall to zero while the loop remains active. Add an inhibitory reset and the circuit becomes a one-bit latch: set, retain, reset.
Calling this “memory” is precise at the state-machine level. It does not yet mean episodic memory, learning or semantic recall. The net holds a distinction among future trajectories because its current state summarises something about the past. That is enough to change its computational class relative to bounded-depth feed-forward nets.
Causal probe 8 · Why is recurrence more than a longer chain?
A longer acyclic chain remembers only a fixed number of steps determined by its length. A loop can refresh its state indefinitely. No finite unrolling covers every possible duration, even though any particular finite run can be unrolled after the fact.
The net predicts forward more readily than it explains backward
Near the end, McCulloch and Pitts compare nervous nets with the computability framework already established by Turing, Church and Kleene. A net equipped with tape, scanners connected to afferents and effectors capable of the required operations computes only Turing-computable numbers; conversely, the Turing-computable numbers can be computed by such an augmented net. Recurrent nets without the external apparatus compute some of those numbers, but no numbers outside the class and not all within it.
The statement is a boundary, not a claim that the brain literally carries a paper tape. External memory and input/output machinery make the net a universal-style computing system. The equivalence concerns computable functions under idealised rules. It says nothing about efficiency, learnability, noise tolerance, energy, anatomical plausibility or which computation an organism actually performs.
The paper’s causal discussion begins from a simpler asymmetry. Given the complete current state and the fixed net, the next state is determined. The reverse inference is generally not unique. An OR output of one could have followed inputs 10, 01 or 11. Disjunction merges distinct histories. Recurrence can further hide when an initiating event occurred.
From this mathematical many-to-one map, the authors move to claims about observations, perception, memory, psychiatric inference and mind. The formal asymmetry genuinely illustrates why outputs can underdetermine causes. Yet the stronger philosophical conclusions require assumptions about how the model relates to living nervous systems and to mental categories. They should be read as an ambitious research programme, not as corollaries with the same proof status as Theorem I.
Evidence boundary · Three layers must stay distinct
The calculus proves results about idealised binary nets. Treating those nets as models of nervous systems is an empirical interpretation. Extending that interpretation to knowledge, purposiveness or mind is philosophical argument. Historical importance does not flatten these layers into one evidential grade.
A foundational abstraction is not a finished neuroscience
The model’s scientific power came from choosing variables that could support exact reasoning. That choice also marks its limits. Biological neurons integrate graded conductances over heterogeneous times, spike stochastically, adapt, change synapses, express diverse cell types and participate in chemical as well as electrical processes. Even the notion of one synchronous synaptic delay is a modelling convenience.
Modern artificial neurons also differ. They usually compute weighted sums, apply nonlinear activation functions and change parameters through an optimisation rule. A McCulloch–Pitts net can represent threshold logic, but the 1943 paper contains neither the perceptron learning rule nor backpropagation. Calling it the first deep-learning paper would erase the very gaps that later work had to fill.
Its durable legacy lies in a cluster of ideas: computation can be distributed across simple interacting units; network state can carry temporal information; logical behaviour can be realised by physical organisation; recurrence changes what finite structure can express; and mechanistic diagrams can be subjected to formal analysis and synthesis. Those are foundations for neural computation, automata and cybernetics even when the biological details are replaced.
The paper also offers a caution for contemporary interpretability. Observed behaviour may be compatible with many internal networks. Recovering a unique mechanism from input–output traces is not guaranteed. Rich interventions, intermediate measurements and structural priors are needed to narrow the alternatives.
Run the gates, delays and loop as exact state transitions
The laboratory implements the paper’s core abstraction directly: binary state, integer excitation threshold, one-step propagation and absolute inhibitory veto. Six profiles cover static disjunction, conjunction, conjunction-with-negation, a two-step delay, a falling-edge detector and a self-sustaining recurrent loop.
Each run is checked against an independently written logical specification rather than against another copy of the same network update. The test suite exhausts the three primitive truth tables, compares every selected trace with its direct formula, tests recurrence against an acyclic control after the input disappears, and enumerates the three predecessor states that collapse into OR=1.
Four images to carry away
1 · The veto bar
Enough excitation opens the gate, but one active inhibitory line closes it absolutely. The two clauses should never be blended into one weighted sum.
2 · The disappearing diagram
Substitute each internal neuron’s proposition into the next. In an acyclic net the boxes vanish until only delayed inputs remain.
3 · The circuit compiler
Read in the opposite direction: delay and three connectives become a kit from which a temporal specification is wired.
4 · The returning arrow
A circle lets an old event refresh itself. Fixed path length becomes persistent state, and the past no longer has a fixed horizon.
The sequence turns from learning rules to representational machinery
The first forty-five canon papers built a language for computation, uncertainty, inference, causal identification, optimisation and resource-aware learning. Paper 0046 opens the neural-representation module at a more elementary layer. It asks how a network of simple stateful units can stand for a proposition at all.
Its answer joins representation to dynamics. A neuron’s firing is not a symbol pasted onto tissue; it is a proposition whose truth follows from the previous network state. A path represents delay, a converging threshold represents a connective, and a circle represents potentially unbounded dependence on history. Structure becomes syntax only through an update law.
This is a foundation for later neural models, not a miniature version of them. Rosenblatt will add an adaptive classification rule. Backpropagation will supply gradients for layered representations. Universal-approximation results will describe function classes. Deep convolutional and residual systems will coordinate learned weights at scale. McCulloch and Pitts supply an earlier hinge: a net can be treated as both organised matter and formal computation.
For the wider consciousness programme, the paper establishes both an invitation and a restraint. It invites exact accounts of how organised activity could realise distinctions, memories and purposive responses. It restrains inference from behaviour to mechanism: the same proposition may have many realising nets, and a formal model of neural activity does not by itself settle the ontology of mind.
From one firing rule to the two-way calculus
Step 1 · Fix a clock and state
Assign every neuron a binary action Nᵢ(t). Inputs at t−1 determine internal actions at t through threshold and inhibitory veto.
Step 2 · Write each local condition
For every internal neuron, enumerate the excitatory combinations meeting its threshold and exclude every active inhibitor. This yields a temporal proposition over immediate predecessors.
Step 3 · Exploit acyclicity
Substitute internal conditions upstream. A topological rank decreases, so the expansion terminates as an expression over peripheral afferents and delays.
Step 4 · Reverse the map
Realise delayed variables, disjunction, conjunction and inhibited conjunction as primitive nets. Compose the primitives in the parse-tree order of any permitted expression.
Step 5 · Add recurrence carefully
A circle introduces state that can depend on an unbounded past. Finite substitution gives way to a description of classes of temporal histories and periodic relations.
How to read a neural-computation claim without losing its assumptions
- Name the state variable. Is activity binary, graded, stochastic, continuous-time or event-driven?
- State the timing law. Record propagation delay, update order and whether the system is synchronous.
- Separate excitation from inhibition. An absolute veto, a signed weight and divisive inhibition are different mechanisms.
- Identify the source of activity. Ask how constants, initial conditions and spontaneous firing enter, especially when the all-false row maps to true.
- Declare the equivalence relation. Does preservation include exact latency, intermediate state, robustness, energy or only final output?
- Check for cycles. Recurrence turns a finite-depth formula into a stateful temporal system.
- Keep analysis apart from identification. Calculating behaviour from a known net does not make the net uniquely recoverable from behaviour.
- Grade extrapolations. Distinguish theorem, model interpretation, biological claim and philosophical consequence.
What this companion adds
This companion restores the parts often lost in the “neurons as gates” summary. Ten paper-specific animated figures move from the five assumptions and inhibitory firing rule through temporal delay, net-to-formula analysis, formula-to-net synthesis, the quiet-net restriction, behavioural equivalence, transient detection, recurrence and the joint computability/causal boundary.
The executable laboratory turns those ideas into auditable state transitions. Six profiles are verified against independent truth tables and temporal formulae, including a recurrent control and an explicit many-to-one predecessor search. The teaching sequence preserves the primary’s constructive ambition while marking where its biology and philosophy exceed the proved calculus.
Two independent passes
Scholarly and editorial review: pass. The complete 19-page primary scan was rendered and inspected. The five assumptions, Theorems I–X, transient-cooling construction, Figure 1, computability paragraph and consequences were mapped to journal pages. Learning, biological realism and later neural-network results are not attributed to the 1943 calculus, and formal results remain distinct from modelling and philosophical extensions.
Executable and publication review: pass. All six laboratory profiles pass four exact audits locally. Responsive rendering at 1440, 768 and 390 pixels has no horizontal overflow; SVG titles and descriptions, reduced-motion behaviour, labelled controls and live output are present; duplicate-ID, substantive-word, placeholder and AI-telltale scans are clean.
References and source trail
- Warren S. McCulloch and Walter Pitts, “A logical calculus of the ideas immanent in nervous activity,” The Bulletin of Mathematical Biophysics 5(4), 115–133 (1943). DOI record; archival scan used for page verification.
- Alan M. Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society s2-42(1), 230–265 (1937). DOI record.
- Rudolf Carnap, The Logical Syntax of Language (1937 English edition; cited by the primary’s formal notation). Archive record.
- David Hilbert and Wilhelm Ackermann, Principles of Mathematical Logic (English translation of the work cited by the primary for normal-form conditions). Archive record.
- Tara H. Abraham, “(Physio)logical circuits: the intellectual origins of the McCulloch-Pitts neural networks,” Journal of the History of the Behavioral Sciences 38(1), 3–25 (2002). PubMed record.
- Gualtiero Piccinini, “The First Computational Theory of Mind and Brain: A Close Look at McCulloch and Pitts’s ‘Logical Calculus of Ideas Immanent in Nervous Activity’,” Synthese 141, 175–215 (2004). DOI record.
- Rodrigo de Castro, “The dawn of mathematical biology,” arXiv:1511.01455 (2015). arXiv record.
- Osnat Goldental et al., “A computational paradigm for dynamic logic-gates in neuronal activity,” Frontiers in Computational Neuroscience 8 (2014). Later biological contrast.