Question

1. An unsolvable problem is a problem for which no solution exists. no algorithm exists for finding the solution. no one knows the solution. no one wants to know the solution. [2] 2. Turing machines consist of a central processor and main memory vacuum tubes paper tape and a paper punch a read/write head and a tape [2] 3. The class of problems known as NP is so named because it is composed of which of the following? Non-deterministic polynomial problems Non-universal problems Non-programmable problems Non-polynomial problems

          1. An unsolvable problem is a problem for which
no solution exists.
no algorithm exists for finding the solution.
no one knows the solution.
no one wants to know the solution.
[2] 2. Turing machines consist of
a central processor and main memory
vacuum tubes
paper tape and a paper punch
a read/write head and a tape
[2] 3. The class of problems known as NP is so named because it is composed of which of the following?
Non-deterministic polynomial problems
Non-universal problems
Non-programmable problems
Non-polynomial problems

Added by Henry J.

Question

Please give Ace some feedback