Match the Definition with the Term

Multiple Choice

Match the definition with the term.
-Turing machine

A) a calculating machine that could compute sums and differences of complex sequences of squared numbers
B) a computer program that reproduced formal proofs for some of the basic theorems at the heart of symbolic logic
C) a hypothetical architecturally simple "universal" computer that could perform any kind of calculation on any set of symbols capable of being manipulated in the Boolean sense,according to some set of formally specifiable and self-consistent rules
D) an AI program that uses heuristics intended to be capable of solving a broad range of types of problems
E) planned but never-finished "universal machine," capable of performing virtually any type of calculation; prototype for what today we call a programmable computer