Mathematician, engineer
Claude E. Shannon
Also credited as Claude Shannon
The engineer who gave information a unit and turned communication into a mathematical problem.
Shannon wrote two theses that separately founded whole fields. The 1937 master's thesis showed that relay and switching circuits could be analyzed with Boolean algebra, which turned logic into hardware. The 1948 paper on communication theory defined information as a measurable quantity and set the limits on how reliably a message could travel through a noisy channel.
His style was unusually concrete. He built machines to test ideas, including a maze-solving mouse, and he was happy to apply the same mathematical instincts to juggling or to predicting the entropy of printed English. The work reads as play until the results land.
The honest limit on Shannon is that the famous papers are short and dense. They are best read after the textbook versions, and this dossier links the originals so a reader can see how much room the original leaves for interpretation.
Life in order
- 1916
Born in Petoskey, Michigan
Born on April 30 and raised in Gaylord. An aunt who taught mathematics and a namesake ancestor, a mathematician, shaped his early interests.
- 1936
Undergraduate degree
Graduated from the University of Michigan with degrees in mathematics and electrical engineering.
- 1937
The switching thesis
Completed a master's thesis at MIT applying Boolean algebra to relay circuits. It became the standard way to connect logic to switching hardware.
Document A Symbolic Analysis of Relay and Switching Circuits, 1937 - 1940
Doctorate
Received a doctoral degree from MIT for work on theoretical genetics, then spent a year at the Institute for Advanced Study.
- 1941
Bell Labs
Joined Bell Telephone Laboratories during the war, working on fire-control systems and on cryptography, including work with Turing on secure speech.
- 1945
A confidential report on communication
Circulated a private report on a mathematical theory of communication. Its central idea, that information could be measured and that noise set a hard limit, reached a wide audience three years later.
- 1948
A Mathematical Theory of Communication
Published the paper in the Bell System Technical Journal. It introduced the bit and the notion of channel capacity and founded information theory.
Paper A Mathematical Theory of Communication, 1948 - 1949
Secrecy systems
Published an unclassified account of cryptography for Bell Labs, framing secrecy as a communication problem with its own limits.
Paper Communication Theory of Secrecy Systems, 1949 - 1950
A maze-solving machine
Described a relay machine that could learn to solve a maze and remember the route, one of the first working demonstrations of machine learning in hardware.
Document Presentation of a Maze-Solving Machine, 1951 - 1951
Predicting printed English
Measured how well a reader could guess the next letter of a text, and used the result to estimate the redundancy of English.
Paper Prediction and Entropy of Printed English, 1951 - 1956
Return to MIT
Became a professor at MIT and taught a generation of students, while publishing less than his reputation suggested.
- 1978
Reprint and reflection
A widely used reprint of the communication paper carried a new introduction by Warren Weaver and, in later printings, Shannon's own retrospective.
- 1981
Juggling as mathematics
Published an analysis of juggling in a collection honoring his work, treating the timing of throws as a problem in control and pattern.
Document Scientific Aspects of Juggling, 1993 - 2001
Death
Died on February 24 after a long illness with Alzheimer's disease. His name is attached to a channel capacity, an early species of information, and a branch of mathematics.
Start with these
The founding paper. Dense, short, and worth reading alongside a modern textbook.
A Symbolic Analysis of Relay and Switching CircuitsThe thesis that linked Boolean logic to relays, and by extension to digital design.
Communication Theory of Secrecy SystemsThe cryptography companion paper, written for security rather than signals.
Prediction and Entropy of Printed EnglishA small experiment with large consequences for compression and language modelling.
Also in the library
- Technical PapersA Proposal for the Dartmouth Summer Research Project on Artificial IntelligencePaper listed in Volume III under AI & Machine Learning.
- Computing & SocietyAutomata StudiesSupplied bibliography entry.
- Information TheoryCoding Theorems for a Discrete Source with a Fidelity CriterionSupplied bibliography entry.
- Technical PapersPresentation of a Maze-Solving MachineDocument listed in Volume III under Computing & Information Pioneers.
- Machine LearningProgramming a Computer for Playing ChessSupplied bibliography entry.
- Technical PapersScientific Aspects of JugglingDocument listed in Volume III under Computing & Information Pioneers.