Source Summary: Shannon 1948 (1940 Master’s Thesis)
Full title: Symbolic Analysis of Relay and Switching Circuits
Authors: Claude Elwood Shannon
Affiliation: MIT, Department of Electrical Engineering
Venue: MIT Master’s Thesis (submitted 1937, filed 1940); published in Transactions of the AIEE, Vol. 57 (1938), pp. 713–723
PDF: papers/shannon-1938-symbolic-analysis-of-relay-and.pdf
Contributions
- Boolean algebra → circuit design — first application of George Boole’s symbolic logic to electrical switching circuits, proving that circuit analysis and synthesis are Boolean algebra problems.
- Hinderance calculus — defined a formal algebra of switching circuits with variables for open (1) and closed (0) contacts, showing it obeys Boolean postulates.
- Circuit analysis — systematic method to determine the operating characteristics of any given switching network.
- Circuit synthesis — method to find the simplest circuit implementing a given logical specification (minimizing switch blades and relay contacts).
- Practical applications — designed specific circuits for a combination lock, vote counter, binary adder, and factor table machine using the calculus.
Methodology
The hinderance algebra
Shannon assigned hinderance variables to each relay contact or switch:
- X = 0: circuit is closed (conducts, zero impedance)
- X = 1: circuit is open (doesn’t conduct, infinite impedance)
(Note: 0=closed, 1=open — the opposite of modern convention)
Operations:
- Series connection: X + Y (hinderance product — both must be closed)
- Parallel connection: X · Y (hinderance sum — either can be closed)
- Complement: X’ (normally-closed contact)
Boolean postulates verified
| Postulate | Circuit meaning |
|---|---|
| 0 · 0 = 0 | Two closed switches in parallel = closed |
| 1 + 1 = 1 | Two open switches in series = open |
| X · X’ = 1 | Switch in series with its inverse = always open |
| X + X’ = 0 | Switch in parallel with its inverse = always closed |
Shannon showed all nine Boolean postulates hold, so all theorems of Boolean algebra apply to switching circuits.
Key theorems applied
- De Morgan’s theorem: complement of series = parallel of complements
- Expansion theorem: any function can be expanded in terms of any variable
- Minimization: simplest circuit found by Boolean simplification of the hinderance function
Circuit Examples (Chapter V)
Binary adder
- Full adder for two binary digits using relay contacts
- Sum bit and carry bit expressed as Boolean functions
- Realized as a minimal relay circuit
Combination lock
- A lock requiring a specific sequence of switch operations
- Designed as a state machine using relay circuits
- Illustrates sequential (non-combinatorial) circuit synthesis
Vote counter
- 3-out-of-5 majority function
- Boolean minimization reduces the number of relay contacts needed
Factor table machine
- Determines whether a number has specific prime factors
- Demonstrated that complex arithmetic logic is expressible and realizable as switching circuits
Historical context
Shannon was a 21-year-old MIT master’s student when he wrote this thesis, supervised by Vannevar Bush (who had built the Differential Analyzer, an analog computer). Bush suggested Shannon apply Boole’s algebra — previously considered pure mathematics with no engineering relevance — to the relay circuits that had been designed ad hoc by intuition.
The thesis was described by Howard Gardner as “possibly the most important, and also the most famous, master’s thesis of the century.”
Limitations
- Treats only two-terminal and n-terminal networks of relay contacts; does not address more complex logical structures (this was addressed in Shannon’s 1948 information theory paper)
- The synthesis method finds the simplest series-parallel circuit; for non-series-parallel networks, complete minimization is harder
- Does not address timing, propagation delay, or sequential circuit hazards (race conditions)
Key References
- Boole 1854 — Laws of Thought (the Boolean algebra being applied)
- Bush — Differential Analyzer (context of electromechanical computing)
- Whitehead & Russell — Principia Mathematica (logical calculus reference)