Exam 22: Limits to Computation

The application of several computers to one task is ________ .

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

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

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

The computer is

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

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

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

Computers are still a long way from being perfect .

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

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

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

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 .

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

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

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

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 .

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 .

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

Watson's database was built from