Deck 22: Limits to Computation

Question 1

When Turing developed his test, researchers believed that natural language was beyond the capabilities of computers .

Answer 1

True

Question 2

The Universality Principle refers to a property of computation that says all computers with a minimal set of instructions can compute the same set of computations .

Answer 2

True

Question 3

The Doctor program (also known as Eliza), developed by MIT researcher Joseph Weizenbaum, clearly demonstrated that a computer does have intelligence .

Answer 3

False

Question 4

Computers are still a long way from being perfect .

Question 5

The field of medicine is one area that is beyond the realm of future applications of Watson .

Question 6

One problem Watson must solve is to figure out the type of answer required .

Question 7

It is much harder for an AI computer to play chess than to play Jeopardy!

Question 8

Computer scientists say that an algorithm is fast if its running time grows slowly the more data it has to work on .

Question 9

Since Watson is not self-contained, it is available on the Internet .

Question 10

When a standard desktop computer runs the Watson program, it takes no more than six seconds to answer any Jeopardy! question posed to it .

Question 11

AlphaGo builds on Deep Blue's foundations by using deep neural networks .

Question 12

Using the Turing test, a computer is deemed to be intelligent if it acts enough like a human to deceive a human judge .

Question 13

Parallel computation is interesting but not essential in developing AI computers .

Question 14

A minimum of 1,024 instructions are necessary to program any computation .

Question 15

When a computer plays chess, the information is represented in

A) black and white
B) natural language
C) bits
D) integers

Question 16

A conceptualization of the possible future configurations of a game is called a

A) future move diagram
B) reachable point diagram
C) schematic answer tree
D) game tree

Question 17

The IBM computer that is credited with beating the reigning chess grand master, Gary Kasparov, is

A) AlphaGo
B) Watson
C) Eliza
D) Deep Blue

Question 18

IBM's semantic analysis system that competed on and won during a special edition of Jeopardy!

A) lacked the ability to parse English
B) featured a huge database
C) included access to the Internet
D) all of these

Question 19

In programming, rules that describe how to operate on other rules are

A) metarules
B) operational rules
C) super rules
D) advanced rules

Question 20

The Universality Principle means that

A) any problem that can be correctly represented in binary can be solved by a computer
B) a program that runs on one computer can be run on any other, although it might take longer
C) if a computer is powerful enough to solve any NP-complete problem, it can solve any other problem
D) if a problem can be solved by one computer, it can be solved by any computer, although perhaps more slowly

Question 21

The program that clearly demonstrated a distinction between being intelligent and being programmed to seem intelligent was

A) AlphaGo
B) Doctor
C) Deep Blue
D) Watson

Question 22

The procedure used by a computer to determine if a specific move in a game will result in the player being better off or worse off is a(n)

A) game chart
B) deep database
C) evaluation function
D) decision structure

Question 23

A(n) ________ is used to check the result of every possible legal move when a computer is deciding on its next move in a game of chess .

A) database
B) game chart
C) game tree
D) evaluation function

Question 24

The application of several computers to one task is ________ .

A) database mining
B) impossible
C) deeper
D) parallel computation

Question 25

Watson's database was built from

A) thousands of computers
B) the Doctor program
C) millions of pages of unstructured input
D) every program on the Internet

Question 26

The computer is

A) intelligent
B) an information processing machine
C) intuitive
D) creative

Question 27

Select all the apply . Which of the following are specialized functions of the Watson program?

A) querying its database
B) selecting and producing an answer
C) filtering results, evaluating relevance to the question
D) parsing English

Question 28

Select all the apply . Which of the following are aspects of natural language?

A) The meaning of a word, phrase, or sentence may be ambiguous .
B) Words are not always used as they are defined in a dictionary .
C) The meaning often depends on the topic being discussed .
D) It often refers to things without spelling them out specifically .

Question 29

Select all the apply . Which of the following are reasons to buy a new computer?

A) Software vendors may not support older computers .
B) New software may run slowly on older computers .
C) Peripherals, like the mouse or speakers, may break down with age .
D) The newest computers use a generic operating system making the need to buy software geared to a MacOS or WindowsOS obsolete .

Question 30

If the solution to a problem is so difficult to solve that large data sets cannot be solved with a realistic amount of computer time, that problem is said to be ________ .

Question 31

Very difficult computations that have no known practical algorithmic solution are known as ________ problems .

Question 32

The ________ Problem is one that cannot be solved by a computer . The Loop-Checker algorithm that checks for infinite loops is one example .

Question 33

Computers cannot understand ________ language, the language that humans use .

Question 34

In the computer game of chess, a(n) ________ function is a procedure that assigns a numerical value to each chess piece when calculating the best possible move .

Question 35

In a chess program, looking ahead to future moves is described as ________ since it involves moving toward the lower layers of possible choices .

Question 36

Getting two or more computers to work on a problem at the same time is called ________ computation .

Question 37

A(n) ________ test is an experimental setting to determine if a computer and a person can be distinguished by their answers to a judge's questions .

Question 38

As the research field of ________ came into existence, a consensus grew that to exhibit intelligence, a computer would have to understand a complex situation and reason well enough to act on that understanding .

Question 39

One reason to caution against declaring that computers can be intelligent by talking about how ________ won a chess match against the reigning grand master is that it is specialized to only chess .

Question 40

Google's DeepMind's AlphGo builds on Deep Blue's foundations using ________ networks .

Question 41

Watson's database is built from documents expressed in ________ language .

Question 42

________ can be thought of as a spectrum ranging from a "flash out of the blue"to "Mondrian in a click . "

Question 43

AI researchers have demonstrated that the ________ form of creativity is algorithmic .