This is a case study in problem-solving, representing part of a program of research on complex information-processing systems. We have specifieda system for finding proofs of theorems in elementary symbolic logic, and by programming a computer to these specifications, have obtained empirical data on the problem-solving process in elementary logic. The program is called the Logic Theory Machine (LT); it was devised to learn how it is possible to solve difficult problems such as proving mathematical theorems, discovering scientific laws from data, playing chess, or understanding the meaning of English prose.The research reported here is aimed at understanding the complexp rocesses (heuristics) that are effective in problem-solving. Hence, we are not interested in methods that guarantee solutions, but which require vastamounts of computation. Rather, we wish to understand how a mathematician, for example, is able to prove a theorem even though he does not know when he starts how, or if, he is going to succeed.Proceedings of the Western Joint Computer Conference, 15:218-239. Reprinted in Feigenbaum and Feldman, Computers and Thought (1963).

The Dawn of Dynamic Programming Richard E. Bellman (1920–1984) is best known for the invention of dynamic programming in the 1950s. During his amazingly prolific career, based primarily at The University of Southern California, he published 39 books (several of which were reprinted by Dover, including Dynamic Programming, 42809-5, 2003) and 619 papers. Despite battling the crippling effects of a brain injury, he still published 100 papers during the last eleven years of his life. He was a frequent informal advisor to Dover during the 1960s and 1970s. Professor Bellman was awarded the IEEE Medal of Honor in 1979 "for contributions to decision processes and control system theory, particularly the creation and application of dynamic programming."

In Applications of Logic to Advanced Digital Computer Programming, Ann Arbor, Mich: University of Michigan Press

Proc. First Intern. Congress of Cybernetics, Namur, 8S-56

RAND Corporation Paper P-987, Santa Monica, Calif

Between 1946 and 1956, a number of BBC radio broadcasts were made by pioneers in the fields of computing, artificial intelligence and cybernetics. Although no sound recordings of the broadcasts survive, transcripts are held at the BBC's Written Archives Centre at Caversham in the UK. This paper is based on a study of these transcripts, which have received little attention from historians. The paper surveys the range of computer-related broadcasts during 1946-1956 and discusses some recurring themes from the broadcasts, especially the relationship of'artificial intelligence' to human intelligence.

John Wiley & Sons, New York

"The modern general-purpose computer can be characterized as the embodiment of a three-point philosophy: (1) There shall exist a way of computing anything computable; (2) The computer shall be so fast that it does not matter how complicated the way is; and (3) Man shall be so intelligent that he will be able to discern the way and instruct the computer." Proceedings of the 1955 Western Joint Computer Conference, Institute of Radio Engineers, New York, pp 101-108, 1955. (Also issued as RAND Technical Report P-620.)

Current issues are now on the Chicago Journals website. Read the latest issue.Since 1950, The British Journal for the Philosophy of Science (BJPS) has presented the best new work in the discipline. Published on behalf of the British Society for the Philosophy of Science, the journal offers innovative and thought-provoking papers that open up new areas of inquiry or shed new light on well-known issues.

The maze can be changed _ any desired mantler by rearranging the partitions between the twen --:five squares. In the maze there is a sensing finger, which can feel the -.:titions of the maze as it comes against them. This finger is moved .- The goal is mounted on a pin which can be slipped into a jack _ any of the twenty-five squares. Thus you can change the problem ..' way you choose, within the limits of the 5 x 5 maze.