Goto

Collaborating Authors



Learning Machines: Foundations of Trainable Pattern-Classifying Systems

Classics

Republished as The Mathematical Foundations of Learning Machines, San Francisco: Morgan Kaufmann Publishers, 1990McGraw-Hill. Republished in 1990.






The Programming Language LISP

Classics

"Among the new languages for instructing computers is a remarkable one called LISP. The name comes from the first three letters of LIST and the first letter of PROCESSING. Not only is LISP a language for instructing computers but it is also a formal mathematical language, in the same way as elëmentary algebra when rigorously defined and used is a formal mathematical language.The LISP language and its implementation on the IBM 7090 computer were worked out by a group including John McCarthy, Stephen B. Russell , Daniel J. Edwards, Paul W. Abrahams, Timothy P. Hart, Michael I. Levin, Marvin L. Minsky, and others.LISP is designed primarily for processing data consisting of lists of symbols. It has been used for symbolic calculations in differential and integral calculus, electrical circuit theory, mathematical logic , game playing, and other fields of intelligent handling of symbols."Information International, Inc, Cambridge, Mass.


A Tough Nut for Theorem Provers

Classics

"It is well known to be impossible to tile with dominoes a checkerboard with two opposite corners deleted. This fact is readily stated in the first order predicate calculus, but the usual proof which involves a parity and counting argument does not readily translate into predicate calculus. We conjecture that this problem will be very difficult for programmed proof procedures."Stanford Artificial Intelligence Project Memo No. 16


Limitations of phrase structure grammars

Classics

In J. A. Fodor and J. J. Katz, The structure of language. Englewood Cliffs, N.J.: Prentice- Hall, 137-151.