📘 A clerk becomes a formal machine
Imagine a person at a desk, following rules one symbol at a time. Turing turned that ordinary act into a machine model you can inspect, compare, and test.
What you’ll learn
- Before the machine: defining computationExplain Turing’s machine model, universality, Church’s parallel formalism, and the difference between computability and undecidability.Computer science begins by making effective procedure precise, then proving that formal power includes rigorous limits.
- The stored-program turnDescribe the EDVAC draft’s logical organs, stored orders, control cycle, collaborative context, and physical memory constraints.The stored-program idea separates a general machine from the particular instructions it runs, while implementation remains an engineering and social project.
- Information becomes measurableDistinguish bits, entropy, noise, redundancy, and capacity from semantic meaning, truth, and usefulness.Shannon’s abstraction makes communication measurable by focusing on selection and reliable transmission under uncertainty.
- Memory and mind become design problemsCompare Bush’s associative trails with Licklider’s real-time symbiosis and identify interaction as a designed division of labor.Computing becomes a medium for memory and thought when representation, feedback, access, and responsibility are designed together.
- Programs become a disciplineConnect Dijkstra’s structured programming argument to the broader founding concerns of procedure, legibility, infrastructure, and historical attribution.The field’s papers invite readers to inspect processes, limits, abstractions, and the institutions that turn ideas into working practice.
Questions this course answers
Match each idea to its role in the foundations of computation.
These ideas separate the mechanics of a procedure, the representation of procedures, a parallel formalism, and limits on algorithmic decision.
Put the stored-program control cycle in order.
A stored-program machine repeatedly fetches a coded order, interprets it, performs it, and continues through memory-based control.
What does Shannon’s entropy measure in its information-theoretic use?
Entropy describes average uncertainty in possible source selections; it does not measure truth, usefulness, or moral value.
Match each paper or essay to the problem it foregrounds.
The works overlap in their concern with organized processes, but each makes a different object central: memory trails, partnership, transmission, or code structure.
Why should a founding paper be read as an intervention rather than a prophecy?
Reading backward from today’s devices can hide the original question, omitted alternatives, collaborators, and limits of the paper’s claim.
Grounded in trusted sources
- Alan Turing, On Computable Numbers, with an Application to the Entscheidungsproblem, 1936, listed with facsimile links by the Turing Digital Archive: https://turingarchive.kings.cam.ac.uk/computable-numbers
- Smithsonian Libraries, First Draft of a Report on the EDVAC, John von Neumann, 1945: https://library.si.edu/digital-library/book/firstdraftofrepo00vonn
- Claude Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, 1948, Harvard Mathematics scan: https://people.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf
- Vannevar Bush, As We May Think, The Atlantic Monthly, 1945, MIT STS scan: https://web.mit.edu/sts.035/www/PDFs/think.pdf
- J. C. R. Licklider, Man-Computer Symbiosis, IRE Transactions on Human Factors in Electronics, 1960, MIT CSAIL archive: https://groups.csail.mit.edu/medg/people/psz/Licklider.html
- E. W. Dijkstra, Go To Statement Considered Harmful, Communications of the ACM, 1968, ACM record: https://dl.acm.org/doi/10.1145/362929.362947
Every Wunder lesson is built from real, reputable sources — never invented.
Related courses
Wunder is a personalized learn-anything platform — tell it any topic and it builds a beautiful, fact-checked course in minutes, with narration, a knowledge check, and a college-style University track.
© 2026 Wunder Learning LLC · Terms & Privacy