Q1. What is artificial intelligence?
A1. It is the science and engineering of making intelligent machines, especially intelligent computer programs. It is related to the similar task of using computers to understand human intelligence, but AI does not have to confine itself to methods that are biologically observable.
Q2. Yes, but what is intelligence?
Q3. Isn't there a solid definition of intelligence that doesn't depend on relating it to human intelligence?
Q4. Is intelligence a single thing so that one can ask a yes or no question "Is this machine intelligent or not?''
Q5. Isn't AI about simulating human intelligence?
Q6. What about IQ? Do computer programs have IQs?
Q7. When did AI research start?
Q8. Does AI aim to put the human mind into the computer?
Q9. Does AI aim at human-level intelligence?
Q10. How far is AI from reaching human-level intelligence? When will it happen?
Q11. Are computers the right kind of machine to be made intelligent?
Q12. Are computers fast enough to be intelligent?
Q13. What about parallel machines?
A13. Machines with many processors are much faster than single processors can be. Parallelism itself presents no advantages, and parallel machines are somewhat awkward to program. When extreme speed is required, it is necessary to face this awkwardness.
Q14. What are the branches of AI?
- Logical AI.
AI programs often examine large numbers of possibilities, e.g. moves in a chess game or inferences by a theorem-proving program. Discoveries are continually made about how to do this more efficiently in various domains.
- Search.
What a program
knows about the world in general the facts of the specific situation in which
it must act, and its goals are all represented by sentences of some mathematical
logical language. The program decides what to do by inferring that certain
actions are appropriate for achieving its goals.
- Pattern recognition.
When a program makes observations of some kind, it is often programmed to
compare what it sees with a pattern. For example, a vision program may try
to match a pattern of eyes and a nose in a scene in order to find a face.
More complex patterns, e.g. in a natural language text, in a chess position,
or in the history of some event are also studied. These more complex patterns
require quite different methods than do the simple patterns that have been
studied the most.
- Representation.
Facts about the world have to be represented in some way. Usually languages of mathematical logic are used.
- Common sense knowledge and reasoning.
This is the area in which AI is farthest from human-level, in spite of the fact that it has been an active research area since the 1950s. While there has been considerable progress, e.g. in developing systems of non-monotonic reasoning and theories of action, yet more new ideas are needed.
- Learning from experience.
Programs do that. The approaches to AI based on connectionism and neural nets specialize in that. There is also learning of laws expressed in logic. Programs can only learn what facts or behaviors their formalisms can represent, and unfortunately learning systems are almost all based on very limited abilities to represent information.
- Planning.
Programs do that. The approaches to AI based on connectionism and neural nets specialize in that. There is also learning of laws expressed in logic. Programs can only learn what facts or behaviors their formalisms can represent, and unfortunately learning systems are almost all based on very limited abilities to represent information.
- Epistemology.
WThis is a study of the kinds of knowledge that are required for solving problems in the world.
- Ontology.
Ontology is the study of the kinds of things that exist. In AI, the programs and sentences deal with various kinds of objects, and we study what these kinds are and what their basic properties are. Emphasis on ontology begins in the 1990s.
- Heuristics.
A heuristic is a way of trying to discover something or an idea imbedded in a program. The term is used variously in AI. Heuristic functions are used in some approaches to search to measure how far a node in a search tree seems to be from a goal. Heuristic predicates that compare two nodes in a search tree to see if one is better than the other, i.e. constitutes an advance toward the goal, may be more useful.
- Genetic programming.
Genetic programming is a technique for getting programs to solve a task by mating random Lisp programs and selecting fittest in millions of generations.
Q15. What are the applications of AI?
- Game playing.
You can buy machines that can play master level chess for a few hundred dollars. There is some AI in them, but they play well against people mainly through brute force computation--looking at hundreds of thousands of positions. To beat a world champion by brute force and known reliable heuristics requires being able to look at 200 million positions per second.
- Speech recognition .
In the 1990s, computer speech recognition reached a practical level for limited purposes. Thus United Airlines has replaced its keyboard tree for flight information by a system using speech recognition of flight numbers and city names. It is quite convenient. On the other hand, while it is possible to instruct some computers using speech, most users have gone back to the keyboard and the mouse as still more convenient.
- Computer vision.
The world is composed of three-dimensional objects, but the inputs to the human eye and computers' TV cameras are two-dimensional. Some useful programs can work solely in two dimensions, but full computer vision requires partial three-dimensional information that is not just a set of two-dimensional views. At present there are only limited ways of representing three-dimensional information directly, and they are not as good as what humans evidently use.
- Expert systems.
A ``knowledge engineer'' interviews experts in a certain domain and tries to embody their knowledge in a computer program for carrying out some task. How well this works depends on whether the intellectual mechanisms required for the task are within the present state of AI. When this turned out not to be so, there were many disappointing results. One of the first expert systems was MYCIN in 1974, which diagnosed bacterial infections of the blood and suggested treatments. It did better than medical students or practicing doctors, provided its limitations were observed. Namely, its ontology included bacteria, symptoms, and treatments and did not include patients, doctors, hospitals, death, recovery, and events occurring in time. Its interactions depended on a single patient being considered. Since the experts consulted by the knowledge engineers knew about patients, doctors, death, recovery, etc., it is clear that the knowledge engineers forced what the experts told them into a predetermined framework. In the present state of AI, this has to be true. The usefulness of current expert systems depends on their users having common sense.
- Heuristic classification.
One of the most feasible kinds of expert system given the present knowledge of AI is to put some information in one of a fixed set of categories using several sources of information. An example is advising whether to accept a proposed credit card purchase. Information is available about the owner of the credit card, his record of payment and also about the item he is buying and about the establishment from which he is buying it (e.g., about whether there have been previous credit card frauds at this establishment).
- Genetic programming.
Genetic programming is a technique for getting programs to solve a task by mating random Lisp programs and selecting fittest in millions of generations.
Contribution: John McCarthy