📘 Founding computer science papers

What you’ll learn

1. Founding papers become clearer when read as interventions rather than propheciesAnalyze founding paper, contemporary problem, teleology, abstraction, omission, vocabulary, available machine, institution, audience, definition, theorem, design, measurement convention, speculation, evidence, priority, authorship, circulation, collaboration, plural origin, and afterlife.Founding papers define portable objects by simplifying historically situated problems. Reading claim type, omission, infrastructure, and competing origin stories prevents later technology from becoming an invented prophecy.
2. Turing turns a human procedure into a machine—and finds a boundary no machine can crossExplain human computor, effective procedure, discrete symbol, divided tape, read-write head, finite state, instruction table, description number, universal machine, simulation, enumeration, diagonal argument, undecidability, circle-free machine, Church, lambda-definability, formal equivalence, Church–Turing thesis, computability, efficiency, and physical constraint.Turing formalizes local human calculation as a symbolic machine, constructs universal simulation, and proves limits on general procedures. Equivalent models support rather than formally prove the Church–Turing thesis.
3. The EDVAC draft makes programs part of the machine’s addressable memoryInterpret EDVAC, 1945 First Draft, arithmetic organ, control organ, memory, input, output, coded order, coded number, stored program, shared memory, address, binary, serial arithmetic, delay line, logical architecture, physical realization, Moore School, Eckert, Mauchly, Goldstine, von Neumann, distribution, public disclosure, priority, patentability, and attribution.The EDVAC draft organizes an electronic computer through logical organs and stored coded orders. Its wide circulation amplified both architectural influence and disputes hidden by the later lone-name label.
4. Shannon measures uncertainty so communication can be engineered independently of meaningModel information source, message, transmitter, signal, channel, noise, receiver, destination, choice, probability, logarithm, bit, entropy, redundancy, channel capacity, coding theorem, error probability, asymptotic limit, semantic boundary, truth, significance, implementation, delay, power, and engineering tradeoff.Shannon measures selection under uncertainty and establishes limits for reliable communication through noise. Bracketing meaning makes the theory general without turning information into truth or prescribing one device.
5. Bush and Licklider recast computers as partners in memory and thoughtCompare Bush, 1945 As We May Think, memex, microfilm, associative indexing, link, named trail, annotation, sharing, information overload, authored association, search ranking, Licklider, 1960 Man-Computer Symbiosis, formulative thinking, formulated problem, goal, hypothesis, criterion, evaluation, routinizable work, real-time interaction, display, compatible language, latency, feedback, reversibility, error recovery, access, responsibility, and nonlinear afterlife.Bush’s memex preserves user-authored trails through records; Licklider’s symbiosis couples human judgment with routinizable computation during formulation. Both make interaction a designed division of labor rather than a prophecy of one modern system.

Questions this course answers

Grounded in trusted sources

• King's College Cambridge Turing Digital Archive and Stanford Encyclopedia of Philosophy — On Computable Numbers, Turing Machines, and the Church–Turing Thesis, specifically grounding Turing's 1936 human-computation analysis, divided tape, scanned symbol, finite state, instruction table, description numbers, universal machine, circle-free and satisfactory-number arguments, undecidability, equivalence with Church's lambda-definability, and the distinction between a formal theorem and the thesis about effective calculability: https://turingarchive.kings.cam.ac.uk/computable-numbers and https://plato.stanford.edu/entries/turing-machine/ and https://plato.stanford.edu/entries/church-turing/
• Smithsonian Libraries — public-domain First Draft of a Report on the EDVAC, specifically grounding the 1945 report's arithmetic, control, memory, input, and output organs; binary serial design; coded numbers and orders; stored-program organization; Moore School and US Army context; report metadata; distribution date; and the need to distinguish the document's named author from the collaborative design setting: https://library.si.edu/digital-library/book/firstdraftofrepo00vonn
• Harvard University Department of Mathematics — Claude Shannon's A Mathematical Theory of Communication, specifically grounding the source-transmitter-channel-noise-receiver-destination model, logarithmic information measure, bit, source entropy, redundancy, noisy-channel capacity, coding theorem, asymptotic reliability, and deliberate exclusion of semantic meaning from the engineering problem: https://people.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf
• Massachusetts Institute of Technology — Vannevar Bush's As We May Think, specifically grounding the 1945 postwar information-overload problem, projected recording and microfilm mechanisms, memex desk, associative indexing, adjacent items, named trails, annotations, retrieval, duplication, trail sharing, and the distinction between user-authored association and automatic relevance ranking: https://web.mit.edu/sts.035/www/PDFs/think.pdf
• MIT Computer Science and Artificial Intelligence Laboratory — J. C. R. Licklider's Man-Computer Symbiosis, specifically grounding the 1960 contrast between formulated and formulative problems, complementary human and machine roles, goals, hypotheses, criteria, evaluation, routinizable work, real-time interaction, memory organization, displays, input-output equipment, compatible languages, and research requirements for intellectual partnership: https://groups.csail.mit.edu/medg/people/psz/Licklider.html

Every Wunder lesson is built from real, reputable sources — never invented.

Related courses