Artificial Intelligence : Usfssg Computers to Think about Thinking . Part 1

In 1950, Alan M. Turing, the late deputy director of the University of Manchester’s Computing Laboratory in England, proposed a novel test to determine whether a machine was capable of thinking. In thk test, an interrogator has a teletype conversation with a man and a woman, both of whom must try to convince the interrogator that they are the woman. At some point unknown to the interrogator, the man is replaced by a machine. If the interrogator is fooled as often by the machine as by the man, that machine can be said to have displayed intelligent behavior. 1 Some 30 years after Turing proposed this test, many aspects of human behavior have been simulated by a computer. Programs have been designed to play checkersz and chess,J prove mathematical theorems ,4,5 and even mimic the behavior of a paranoid human being.b Despite the success of these and many other programs, none of the researchers investigating what’s been variously cafled “applied epistemology” or “artificial intelligence” (AI) would claim this means the “thinking machine” has arrived. Instead, they would agree that these programs have contributed important information about human behavior, and how computers can simulate it. The first part of this two-part essay will review some of the theones AI researchers have developed to explain human “information processing.” The second part of the essay will cover some applications of AI research. These include programs used in robotics, programs that communicate with computer users in natural languages such as English, and “expert systems” which help chemists, physicians, and others perform decision-making tasks. The “pioneer” expert system, DENDRAL, will be discussed in some detail.T.~ AI grew out of the convergence of ideas in several different fields, and the availability of new technologies. According to Avrom Barr and Edward A. Feigenbaum, Stanford University, California, the single most important factor contributing to the birth of the field was the invention of the computer.9 They point out that human beings have always drawn analogies between mechanical devices and their own behavior. Computers, with their memories and information-processing abilities, naturafly invited analogies with the human brain. Shortly after digital computers became available, computer scientists began creating programs that, they hoped, would perform tasks generally considered to require intelligence. Their earliest efforts were directed at programming computers to solve puzzles, play games such as chess, backgammon, and checkers, solve mathematical theorems, and translate text from one language to another. The early computer programs performed these tasks, but not very well. For example, chess programs were successful at following the step-by-step instructions for moving chessmen. But computers couldn’t independently gen-

[1]  A. Turing Equivalence of Left and Right almost Periodicity , 1935 .

[2]  A. Turing On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[3]  A. Turing Finite Approximations to Lie Groups , 1938 .

[4]  Alan M. Turing,et al.  The use of dots as brackets in Church's system , 1942, Journal of Symbolic Logic.

[5]  A. Turing A method for the calculation of the zeta-function Universal Turing Machine , 2011 .

[6]  Alan M. Turing,et al.  Practical forms of type theory , 1948, Journal of Symbolic Logic.

[7]  A. Turing ROUNDING-OFF ERRORS IN MATRIX PROCESSES , 1948 .

[8]  Claude E. Shannon,et al.  Programming a computer for playing chess , 1950 .

[9]  A. Turing THE WORD PROBLEM IN SEMI-GROUPS WITH CANCELLATION , 1950 .

[10]  A Diffusion Reaction Theory of Morphogenesis , 1952, Nature.

[11]  A. Turing Some Calculations of the Riemann Zeta-Function , 1953 .

[12]  A. M. Turing,et al.  Review: Arthur W. Burks, The Logic of Programming Electronic Digital Computers , 1953 .

[13]  Martin Davis,et al.  The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions , 2004 .

[14]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[15]  Roger C. Schank,et al.  Conceptual dependency: A theory of natural language understanding , 1972 .

[16]  Gerald Jay Sussman,et al.  A Computer Model of Skill Acquisition , 1975 .

[17]  Advance Papers of the Fourth International Joint Conference on Artificial Intelligence, Tbilisi, Georgia, USSR, September 3-8, 1975 , 1975, IJCAI.

[18]  Marvin Minsky,et al.  A framework for representing knowledge" in the psychology of computer vision , 1975 .

[19]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[20]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[21]  Nicholas V. Findler,et al.  Associative Networks- Representation and Use of Knowledge by Computers , 1980, CL.

[22]  Joshua Lederberg,et al.  Applications of Artificial Intelligence for Chemical Inference: The Dendral Project , 1980 .

[23]  G Kolata,et al.  How can computers get common sense? , 1982, Science.

[24]  Joseph Weizenbaum,et al.  and Machine , 1977 .

[25]  Logic based on Inclusion and Abstraction WV Quine , 2022 .

[26]  Universal Turing,et al.  The chemical basis of morphogenesis reprinted from Philosophical Transactions of the Royal Society ( Part B ) 237 37-72 ( 1953 ) Universal Turing Machine , 2022 .

[27]  Collected Works: Mathematical Logic (RO Gandy and CEM Yates Editors) , 2022 .

[28]  Proposed electronic calculator report for National Physical Laboratory Teddington , 2022 .

[29]  Universal Turing,et al.  Can Digital Computers Think?; Reprinted in (copeland 2004) , 2022 .