Computers & Information Science

First edition, staff issue. The present volume collects three years of Carnegie Institution News Service Bulletins (1933-1935), including articles and scientific papers on a variety of subjects researched by Carnegie staff members around the world (this is the staff edition, as opposed to the press and school editions, which do not include the "Notes on Institution Affairs").

The key article in this volume is "Machine Performs Difficult Mathematical Calculations", an account of the "Congruence Machine" (now known as a Lehmer sieve) developed to determine prime numbers by University of California mathematician Derrick Norman Lehmer (1867-1938). Determining which numbers are prime is a key problem in mathematics, and Lehmer made his name in 1914 by completing the series of primes up to 10 million. The first Lehmer sieve was constructed by Lehmer and his son Derrick Henry in 1926, using bicycle chains and metal rods that closed an electrical circuit when a solution to a factorization problem was found. In 1932 they completed a more advanced device utilizing gears and light beams, which is detailed in the present article. Lehmer sieves were an important early type of mechanical calculator, and the basic concept is still used for mathematical sieves in modern software.

With the ownership inscription of renowned seismologist Hugo Benioff, known for the innovative seismographs he developed, as well as his work charting the locations of deep earthquakes in the Pacific seabed.

First publication of the resolution principle, the standard of logical deduction in AI applications.

The basic computational method in logic programming, the unification algorithm, was proposed by mathematician Jacques Herbrand in 1930, but its first practical use was not discovered until Robinson introduced it in this paper as the basic operation of his resolution principle. “Robinson described his resolution principle as ‘machine-oriented’ in that it was particularly suitable for proofs to be performed by computer, having only one rule of inference that could be applied many times. Robinson’s resolution has since been used as the standard of logical deduction in AI applications” (Hook & Norman, Origins of Cyberspace 865).

“Born in Halifax, England, and having served in the RAF, [Robinson] attended Cambridge University, where he read classics. He received his master's degree in philosophy from the University of Oregon and his doctorate in philosophy from Princeton University in 1956. His interests thereafter focused on computers and logic. In 1963, as a visitor from Rice University in Texas to the Argonne National Laboratories, he became interested in automated reasoning, and in 1963 invented Resolution and Unification. In 1967 he became the Distinguished University Professor at Syracuse University and later Visiting Professor at Edinburgh University in Scotland.” (New York Times obituary).

Bibliography: Hook & Norman, Origins of Cyberspace 865.

First edition of this important work on self-reproduction in machines and life forms, scare in the dust jacket.

 Von Neumann became interested in the abilities of computers to self-reproduce during his work on the Institute for Advanced Studies computer project - noting that, since a Turing machine can make exact copies of any readable sequence, it can copy itself. He hoped to formulate a theory of self-reproduction that would be general enough to explain and predict self-reproduction in both machines and living things. “Viewing the logic of self-replication and self-reproduction through the lens of formal logic and and self-referential systems, von Neumann applied the results of Gödel and Turing to the foundations of biology” with his conjectures hitting “the heart of the probability or improbability of the origin of life” (Dyson, Turing’s Cathedral, pp. 283-285).

 Together with Stanislaw Ulam, von Neumann attempted to develop these ideas for publication, but they remained remained unfinished at his death. “The incomplete manuscript, including a lengthy introduction based on a series of five lectures given by von Neumann at the University of Illinois in 1949, was eventually assembled, with careful editing by Arthur Burks, and published as Theory of Self-Reproducing Automata almost ten years after von Neumann’s death... Our understanding of self-reproduction in biology, and our development of self-reproducing technology, proceeded almost exactly as the proposed theory described” (Dyson, p. 286).