Allen Newell and Herbert Simon receive the 1975 ACM Turing Award

Background

Allen Newell and Herbert A. Simon came to the same problem from two institutions. Newell worked at the RAND Corporation from 1950 to 1961, while Simon had been a professor at Carnegie-Mellon University since 1949 ^[1]. Their early collaboration at RAND also involved J. C. Shaw, and the three of them built both the first list-processing language, IPL, and the heuristic problem-solving programs known as Logic Theorist and General Problem Solver ^[1].

The award

In 1975 the Association for Computing Machinery (ACM) listed Newell and Simon as joint recipients of the A.M. Turing Award ^[1]. The two men were honoured together, for work done together, rather than for separate careers that happened to touch.

What the citation said

The citation described their joint scientific efforts as extending over twenty years, beginning in collaboration with J. C. Shaw at the RAND Corporation and continuing afterwards with numerous faculty and student colleagues at Carnegie-Mellon University. In that work, Newell and his co-recipient Herbert A. Simon made basic contributions to artificial intelligence, the psychology of human cognition, and list processing ^[1].

Those three areas are worth separating. Artificial intelligence is the project of getting machines to do things that, when people do them, are called thinking. The psychology of human cognition is the attempt to describe how people actually think, using the machine as a testable model. List processing is the programming technique that made both possible in practice: instead of fixed blocks of numbers, a program manipulates structures that can grow, shrink and point to one another, which is a natural way to represent symbols, concepts and goals.

Logic Theorist and General Problem Solver

The Logic Theorist, built in 1955-56, was used to prove theorems from Russell and Whitehead's *Principia Mathematica* ^[2]. Proving theorems is a search problem: from the available axioms and rules, an enormous number of derivations can be constructed, and most lead nowhere. The programs of this line attacked that explosion with heuristics — rules of thumb that rank promising moves ahead of unpromising ones instead of enumerating everything.

The General Problem Solver followed in 1957-8, elaborating the principles of the Logic Theorist ^[2]. Where the earlier program was aimed at a particular kind of formal proof, GPS tried to state problem-solving method in a form that could be applied across different task domains.

Simon announced the work to his undergraduate class with a sentence that has since been quoted often: "Over the Christmas holiday, Allen Newell and I invented a machine that thinks." ^[2]

Why it mattered

The award marked a programme rather than a single result. The citation's phrase about faculty and student colleagues at Carnegie-Mellon University points to how the work was carried out: not by two people alone, but through a growing group of researchers in which students took part ^[1]. By the time the Turing Award was given, Newell had moved from RAND to Carnegie-Mellon University, where Simon already held a professorship, bringing the collaboration into a single institution ^[1].

The citation also tied together fields that are often treated separately today. It credited the same body of work with contributions to artificial intelligence, to the psychology of human cognition, and to list processing ^[1] — a claim that simulating thought, studying thought, and building the tools for manipulating symbols belong to one enterprise. That framing, more than any individual program, is what the 1975 award recorded. The specific programs were small by later standards and worked on narrow, formal tasks, but the questions they posed — how to search a space of possibilities with limited resources, how to represent knowledge as symbols and lists, and whether a program that solves a problem tells us anything about how people solve it — remained the questions the field kept asking.