Computer Scientists Say That an Algorithm Is Fast If Its

Q33: When a computer plays chess, the information

Q34: In programming, rules that describe how to

Q35: When Turing developed his test, researchers believed

Q36: _ can be thought of as a

Q37: IBM's semantic analysis system that competed on

Q38: In a chess program, looking ahead to

Q39: Watson's database is built from documents expressed

Q40: The procedure used by a computer to

Q41: The Universality Principle means that<br>A) any problem

Q42: The _ Problem is one that cannot