| Question,GroundTruth | |
| Who did the first work generally recognized as AI?,"Warren McCulloch and Walter Pitts (1943)." | |
| What sources was drawn on the formation of the first work generally recognized as AI?, "knowledge of the basic physiology and function of neurons in the brain; a formal analysis of propositional logic due to Russell and Whitehead; and Turing's theory of computation." | |
| Who created the Hebbian learning rule?, "Donald Hebb (1949)." | |
| When the first neural network is built?, "1950" | |
| What is the first neural network called?, "The SNARC." | |
| Who introduced the Turing test?, "machine learning" | |
| Who presented the Logic Theorist (LT)?, "Allen Newell and Herbert Simon from Carnegie Tech." | |
| What does General Problem Solver (GPS) is designed for?, "GPS was designed from the start to imitate human problem-solving protocols." | |
| Which model was robably the first program to embody the thinking humanly approach?, "General Problem Solver (GPS)." | |
| Who formulate the famous physical symbol system hypothesis?, "Allen Newell and Herbert Simon." | |
| What does physical symbol system hypothesis states?, "a physical symbol system has the necessary and sufficient means for general intelligent action." | |
| Who constructed the Geometry Theorem Prover?, "Herbert Gelernter (1959)." | |
| Who defined the high-level language Lisp?, "John McCarthy." | |
| Who discovered a complete theorem-proving algorithm for first-order logic in 1965?, "J. A. Robinson" | |
| Which program in 1963 was able to solve closed-form calculus integration problems typical of MIT's first-year college courses?, "James Slagle's Saint program" | |
| What is the most famous microworld?, "The blocks world." | |
| What does the perceptron convergence theorem say?, "The theorem says that the learning algorithm can adjust the connection strengths of a perceptron to match any input data" | |
| What does the book Preceptrons (1969) mentioned?, "Although perceptrons (a simple form of neural network) could be shown to learn anything they were capable of representing | |
| What is the weak methods in 1969?, "a general-purpose search mechanism trying to string together elementary reasoning steps to find complete solutions." | |
| Why weak methods in 1969 are called weak methods?, "They do not scale up to large or difficult problem instances."" | |
| Which program is the first successful knowledge-intensive system?, "The DENDRAL program." |