Exam 12: Models of Computation

The Turing machine must execute instructions in the order that the instructions are numbered.

There is no limit to the amount of ____________________ available on a Turing machine.

Why cannot we compare algorithms running on Turing machines to the same algorithms running on "real" computers?

Discuss at length the assertion that Turing machines define the limits of computability.

The ____ states that if there exists an algorithm to do a symbol manipulation task, then there exists a Turing machine to do that task.

Discuss the ways in which a Turing machine does or does not satisfy the requirement that an algorithm be a well-ordered collection.

The bit inverter Turing machine should have two states . _________________________

Each individual Turing machine instruction describes an operation that is ____________________, requiring no additional explanation, and any Turing machine is able to carry out the operation described.

What do we require any computing agent to be able to do?

A(n)____ takes the bits in a string and changes the 1s to 0s and the 0s to 1s.