AI History in Papers
한국어
Ch. 1 Origins 1943–56

Origins: cybernetics and computation (1943–1956)

Can brain, machine and information be written in one language?

Key point

The first point on this site is McCulloch and Pitts, "A logical calculus of the ideas immanent in nervous activity", in the December 1943 issue of the Bulletin of Mathematical Biophysics. Starting from the all-or-none character of nervous activity, they treated neural events and their relations by propositional logic. The paper concludes in both directions: the behavior of any net can be described in these terms, and for any logical expression satisfying certain conditions a net can be found that behaves as it describes. Before the phrase "thinking machine" was current, the claim that thinking can be written as computation was already in print.

Wiener's Cybernetics (1948, Technology Press/Wiley) declared: "We have decided to call the entire field of control and communication theory, whether in the machine or in the animal, by the name Cybernetics", and placed feedback, time series, computing machines and the nervous system in one frame. The 1948 printing is lending-only, so this version read MIT Press's open-access 2019 reissue of the 1961 second edition, and confirmed in the notes to Part I that it cites McCulloch–Pitts and Rosenblueth, Wiener and Bigelow 1943.

Five years later Shannon's "A Mathematical Theory of Communication" (July 1948, Bell System Technical Journal) measured information on a logarithmic scale and named the base-2 unit the bit. It is a theory of communication, not of intelligence, but the later chapters of this site cannot be written without it: the perplexity of language models, learning as compression, entropy loss functions all come from here. In a footnote Shannon pointed to Wiener's "forthcoming book Cybernetics", one of the four citation lines confirmed in this chapter.

Shannon immediately set another problem. "Programming a computer for playing chess" was read at the IRE convention on 9 March 1949 and printed in the Philosophical Magazine in March 1950. Chess was chosen as a test of whether a general-purpose computer could handle non-numerical problems; the paper proposes an evaluation function of positions (material, pawn structure, mobility) combined with look-ahead over move variations. The lineage of measuring intelligence by games — Samuel in chapter 2, Deep Blue in chapter 4, AlphaGo in chapter 5 — starts here.

1949 also brought Hebb's The Organization of Behavior (1949, Wiley). On page 62 of a book meant to connect neurophysiology and psychology is one sentence: when cell A repeatedly takes part in firing cell B, a change takes place in one or both cells such that A's efficiency is increased. That sentence is the original text of what later literature calls the Hebb rule; Rosenblatt's perceptron in chapter 2 and Hopfield's network in chapter 3 cite the book. Its bibliography does not list McCulloch–Pitts: the two traditions at first ran separately.

The chapter's last point is neither a network nor a game. Chomsky's "Three models for the description of language" (September 1956, IRE Transactions on Information Theory) states that no finite-state Markov process producing symbols state by state can serve as an English grammar. That it appeared in an information-theory journal, and cites Shannon and Weaver's book, shows the air of the period: language, logic, information and neurons were discussed in one room for a few years. That room was the Dartmouth meeting of summer 1956. Its proposal (McCarthy et al., August 1955) did not pass this version's selection rule and has no point, but the textbooks agree that the name "artificial intelligence" was coined there.

Turing's "Computing Machinery and Intelligence", in the October 1950 issue of Mind, does not try to define the question "Can machines think?" but replaces it: in an "imitation game" in which an interrogator questions a machine and a human by teleprinter, can a suitably programmed digital computer play satisfactorily? The rest of the paper answers nine objections to machine thinking and proposes learning machines taught like a child. Minsky 1961 and McCarthy–Hayes 1969 in chapter 2 and Newell–Simon 1976 in chapter 3 cite it in their reference lists. This version read it in an Internet Archive scan of the Mind pages.

What was and was not checked

Of the seven papers, the original printings of Shannon 1948, Hebb 1949, Turing 1950 and Chomsky 1956 were read; Wiener was read in the 2019 reissue. McCulloch–Pitts was read in the 1990 reprint (Bulletin of Mathematical Biology vol. 52), Shannon 1950 in a retyped copy without page numbers, so no page is given for its quotation.

Lineage

Neural network learning Language and speech Search, planning and knowledge Probability, statistics and origins 1945 1950 1955
Solid lines are confirmed citations (OpenAlex or the citing paper's own reference list); dotted lines are influences stated in textbooks without a confirmed citation. Vertical position is the theme group.

Paper list (7)

A logical calculus of the ideas immanent in nervous activity

Warren S. McCulloch, Walter Pitts · First public 1943-12 (journal issue) · Venue: The Bulletin of Mathematical Biophysics, 5(4) · Pages 99–115 (1990 reprint); original 115–133 · Citations (OpenAlex) 18,560 (checked 2026-11-03)

DOI · Bulletin of Mathematical Biology reprint 1990 (vol. 52, pp. 99–115)

It is found that the behavior of every net can be described in these terms, with the addition of more complicated logical means for nets containing circles; and that for any logical expression satisfying certain conditions, one can find a net behaving in the fashion it describes.p. 99 (1990 reprint, abstract)

What changed. Treats neural events and their relations by means of propositional logic, based on the all-or-none character of nervous activity. Shows that the behavior of every net can be described in these terms and that for logical expressions satisfying certain conditions a net can be constructed that behaves as described.

Cites (within this list): none
Cited by (within this list): Barto et al. 1983, Hopfield 1982, Rosenblatt 1958, Schmidhuber 2014, Wiener 1948

A Mathematical Theory of Communication

Claude E. Shannon · First public 1948-07 (journal issue) · Venue: Bell System Technical Journal, 27(3) and 27(4) · Pages 379–423; 623–656 · Citations (OpenAlex) 88,497 (checked 2026-11-03)

DOI · Part II: BSTJ 27(4):623–656, October 1948 (Crossref 10.1002/j.1538-7305.1948.tb00917.x published-print 1948-10); Wiley online 2013-07-29

In the present paper we will extend the theory to include a number of new factors, in particular the effect of noise in the channel, and the savings possible due to the statistical structure of the original message and due to the nature of the final destination of the information.p. 379

What changed. Extends the theory of communication of Nyquist and Hartley to include the effect of noise in the channel and the statistical structure of the message. Uses a logarithmic measure of information, with base-2 units called bits.

Cites (within this list): Wiener 1948
Cited by (within this list): Bommasani et al. 2021, Chomsky 1956, Schmidhuber 2014, Touvron et al. 2023

Cybernetics: or Control and Communication in the Animal and the Machine

Wiener, Norbert · First public 1948 (book) · Venue: Book: The Technology Press (Cambridge, MA) / John Wiley & Sons (New York) / Hermann et Cie (Paris), 1948 [publishers per archive.org catalog records and the Introduction's mention of Hermann et Cie]; read in: MIT Press, Cambridge MA, 2019 reissue · Pages Part I (Original Edition 1948) pp. 1–230 of the 2019 reissue (Part II begins p. 231); Introduction pp. 3–42

DOI · Introduction dated November 1947; second edition 1961 (adds Preface and Chapters IX-X); first MIT Press paperback February 1965; MIT Press reissue 2019

We have decided to call the entire field of control and communication theory, whether in the machine or in the animal, by the name Cybernetics, which we form from the Greek χυβερνήτης or steersman.p. 18 (2019 reissue pagination, Introduction of the 1948 edition)

What changed. Names the combined field of control and communication theory in machines and animals 'cybernetics' and sets out its treatment of feedback, time series and information, computing machines and the nervous system. Draws together the author's wartime work on prediction and feedback with neurophysiology and statistical mechanics.

Cites (within this list): McCulloch & Pitts 1943
Cited by (within this list): Minsky 1961, Shannon 1948, Shannon 1949

Programming a computer for playing chess

Claude E. Shannon · First public 1949-03-09 (conference) · Venue: The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, Ser. 7, 41(314) · Pages 18 pp. (transcription); journal pp. 256–275 per Crossref · Citations (OpenAlex) 618 (checked 2026-11-03)

DOI · Philosophical Magazine Ser. 7, 41(314):256–275, March 1950 (Crossref published-print 1950-03); received 8 Nov 1949 (not a public date)

This paper is concerned with the problem of constructing a computing routine or "program" for a modern general purpose computer which will enable it to play chess.page unknown (transcription has no journal page numbers; first sentence of Section 1, Introduction)

What changed. Considers how to construct a program for a general-purpose computer to play chess, as a test case for machines that handle non-numerical problems. Proposes an evaluation function f(P) of positions (material, pawn formation, piece positions, mobility) combined with look-ahead over move variations.

Cites (within this list): Wiener 1948
Cited by (within this list): McCarthy & Hayes 1969, Samuel 1959, Schaeffer et al. 2007, Silver et al. 2018, Sutton & Barto 1998, Tesauro 1995, Widrow & Hoff 1960

The Organization of Behavior

Donald Olding Hebb · First public 1949 (book) · Venue: New York: John Wiley & Sons; London: Chapman & Hall · Pages book (1949 edition scan); key passage on p. 62 · Citations (OpenAlex) 9,716 (checked 2026-11-03)

DOI · Psychology Press / Taylor & Francis ebook 2005-04-11 (Crossref 10.4324/9781410612403, the manifest DOI)

When an axon of cell A is near enough to excite a cell B and repeatedly or persistently takes part in firing it, some growth process or metabolic change takes place in one or both cells such that A’s efficiency, as one of the cells firing B, is increased.p. 62

What changed. Sets out a neuropsychological theory of behavior meant to connect neurophysiology and psychology. Proposes that repeated activity between cells leads to lasting cellular changes that make one cell more effective in firing another, and uses this for the growth of cell assemblies.

Cites (within this list): none
Cited by (within this list): Barto et al. 1983, Hopfield 1982, Minsky 1961, Rosenblatt 1958, Schmidhuber 2014

Computing Machinery and Intelligence

Alan Mathison Turing · First public 1950-10 (journal issue) · Venue: Mind LIX(236), October 1950 · Pages 433–460 · Citations (OpenAlex) 10,290 (checked 2026-11-03)

DOI

Instead of attempting such a definition I shall replace the question by another, which is closely related to it and is expressed in relatively unambiguous words.p. 433

What changed. Replaced the question 'Can machines think?' with the 'imitation game', in which an interrogator questions a machine and a human by teleprinter, and recast it as whether a suitably programd digital computer could play the game satisfactorily. Discussed objections to machine thinking and proposed building learning machines that are taught like a child.

Cites (within this list): none
Cited by (within this list): Bommasani et al. 2021, McCarthy & Hayes 1969, Minsky 1961, Newell & Simon 1975, Touvron et al. 2023

Three models for the description of language

Noam . Auteur du texte Chomsky · First public 1956-09 (journal issue) · Venue: IRE Transactions on Information Theory, 2(3) · Pages 113–124 · Citations (OpenAlex) 2,829 (checked 2026-11-03)

DOI

We find that no finite-state Markov process that produces symbols with transition from state to state can serve as an English grammar.p. 113

What changed. Compares finite-state Markov grammars, phrase-structure grammars, and transformational grammars as descriptions of English. Argues that finite-state processes cannot serve as an English grammar and that a kernel of simple sentences plus transformations simplifies the grammar.

Cites (within this list): Shannon 1948
Cited by (within this list): Collobert et al. 2011, Graves et al. 2014