Allen Newell, (March 19, 1927 - July 19, 1992) was a American researcher in computer science and pioneer in the field of artificial intelligence and chess software [1] at the Carnegie Mellon University, Pittsburgh, Pennsylvania. In 1958, Allen Newell, Cliff Shaw, and Herbert Simon developed the chess program NSS [2]. It was written in a high-level language. Allen Newell and Herbert Simon were co-inventors of the alpha-beta algorithm, which was independently approximated or invented by John McCarthy, Arthur Samuel and Alexander Brudno [3]. Allen Newell and Herbert Simon received the Turing Award in 1975. Two of Allen Newell's students, Hans Berliner and James Gillogly became computer chess researchers and authors of famous chess computers.
Allen Newell [4]

See also

• History of Alpha-Beta
• History of Computer Chess
• NSS
• Kasparov versus Deep Thought 1989 documentary

Selected Publications

1955 ...

• Allen Newell (1955). The Chess Machine: An Example of Dealing with a Complex Task by Adaptation. Proceedings Western Joint Computer Conference, pp. 101-108. Reprinted (1988) in Computer Chess Compendium
• Allen Newell, Herbert Simon (1956). The logic theory machine-A complex information processing system. IRE Transactions on Information Theory, Vol. 2, No. 3
• Allen Newell, Cliff Shaw, Herbert Simon (1958). Chess Playing Programs and the Problem of Complexity. IBM Journal of Research and Development, Vol. 4, No. 2, pp. 320-335. Reprinted (1963) in Computers and Thought (eds. Edward Feigenbaum and Julian Feldman), pp. 39-70. McGraw-Hill, New York, N.Y. pdf
• Allen Newell, Cliff Shaw, Herbert Simon (1959). Report on a general problem-solving program. Proceedings of the International Conference on Information Processing, pp. 256-264 ^[7]

1960 ...

• Allen Newell, Fred M. Tonge (1960). An Introduction to Information Processing Language V. Communications of the ACM, Vol. 3, No 4 ^[8]
• Allen Newell, N. S. Prasad (1963). IPL-V Chess Position Program. Internal Memo No. 63, Carnegie Mellon University
• Allen Newell (1963). Learning, Generality and Problem Solving. Memorandum RM-3285-1-PR pdf
• Allen Newell, Herbert Simon (1965). An Example of Human Chess Play in Light of Chess Playing Programs. In Norbert Wiener, J. P. Schadé (eds.) Progress in Biocybernetics. Vol. 2, Elsevier

1970 ...

• Gordon Bell, Allen Newell (1971). Computer Structures: Readings and Examples. McGraw-Hill, ISBN-13: 978-0070043572, amazon
• Allen Newell, Herbert Simon (1972). Human Problem Solving. Prentice-Hall
• Allen Newell, Herbert Simon (1976). Computer Science as Empirical Inquiry: Symbols and Search. Communications of the ACM, Vol. 19, No. 3, ACM Turing Award Lecture, pdf from The Computer History Museum ^[9]

1980 ...

• Allen Newell (1980). Physical Symbol Systems. Cognitive Science, Vol. 4, No. 2
• Allen Newell (1982). The Knowledge Level. Artificial Intelligence, Vol. 18, No. 1
• John E. Laird, Paul S. Rosenbloom, Allen Newell (1984). Towards Chunking as a General Learning Mechanism. AAAI 1984
• John E. Laird, Allen Newell, Paul S. Rosenbloom (1987). SOAR: An Architecture for General Intelligence. Artificial Intelligence, Vol. 33, No. 1

1990 ...

• Allen Newell (1990). Unified Theories of Cognition. Harvard University Press
• Hans Berliner (1992). Allen Newell 1927-1992, In Memoriam. ICCA Journal, Vol. 15, No. 3
• Adriaan de Groot (1992). Allen Newell: An Adieu. ICCA Journal, Vol. 15, No. 3
• John E. Laird, Paul S. Rosenbloom (1992). In Pursuit of Mind: The Research of Allen Newell. AI Magazine, Vol. 13, No. 4

External Links

• Allen Newell from Wikipedia
• The AI Genealogy Project :: Allen Newell
• The Mathematics Genealogy Project - Allen Newell
• Allen Newell Collection
• Allen Newell - Biographical Memoirs from The National Academy Press
• Allen Newell from The Computer History Museum
• Evolutionary Portrait Art by Günter Bachelier: Alan Newell
  

References

1. ^ Allen Newell (1955). The Chess Machine: An Example of Dealing with a Complex Task by Adaptation. Proceedings Western Joint Computer Conference, pp. 101-108.
2. ^ Allen Newell, Cliff Shaw, Herbert Simon (1958). Chess Playing Programs and the Problem of Complexity. IBM Journal of Research and Development, Vol. 4, No. 2, pp. 320-335. Reprinted (1963) in Computers and Thought (eds. Edward A. Feigenbaum and Julian Feldman), pp. 39-70. McGraw-Hill, New York, N.Y., pdf
3. ^ John McCarthy Human-Level AI is harder than it seemed in 1955
4. ^ Allen Newell Collection
5. ^ ICGA Reference Database (pdf)
6. ^ dblp: Allen Newell
7. ^ General Problem Solver from Wikipedia
8. ^ Information Processing Language - Wikipedia
9. ^ Physical symbol system from Wikipedia

What links here?