Allen Newell, Herbert Simon
IRE Transactions on Information Theory 2(3), pages 61–79
September 1956
In this paper we describe a complex information processing system, which we call the logic theory machine, that is capable of discovering proofs for theorems in symbolic logic. This system, in contrast to the systematic algorithms that are ordinarily employed in computation, relies heavily on heuristic methods similar to those that have been observed in . human problem solving activity. The specification is written in a formal language, of the nature of a pseudo-code, that is suitable for coding for digital computers. However, the present paper is concerned exclusively with specification of the system, and not with its realization in a computer. The logic theory machine is part of a program of research to understand complex information processing systems by specifying and synthesizing a substantial variety of such systems for empirical study.
keywords
Artificial intelligence, Logic, Automatic programming, Boundary conditions, Circuits, Computational modeling, Computer simulation, Differential equations, Formal languages, Heuristic algorithms, Humans, Information analysis, Information processing, Nonlinear systems, Pattern recognition, Physics computing, Problem-solving
journal or series

IRE Transactions on Information Theory
(IRE TIT)