Exam 11: Models of Computation

The proof by ____ approach assumes that a conclusion is true and shows that the assumption leads to an impossible situation.

In a state diagram, ____ represent transitions from one state to another.

A computing agent must be able to act in accordance with algorithm instructions.

A distinction must be made between a Turing machine as a computing agent and the algorithm it carries out.

A Turing machine cannot produce output.

The Turing machine captures all of the properties that are essential for a computing agent.

In any collection of Turing machine instructions, there can be two different instructions that both begin with the same current state and current symbol.

At any point in time, only a finite number of cells in the Turing machine input contain ____ symbols.

A formal basis for mathematical proofs guarantees the presence of intuitive statements.

What can be done by an algorithm cannot be done by a Turing machine.

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

Turing machines define the limits of ____, which is what can be done by symbol manipulation algorithms.

Bit inversion is an algorithm that a Turing machine can process.

Which of the following statements is correct?

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

The equation for the distance d that a moving vehicle travels - the product of rate r and time t - is considered to be a model.

A Turing machine can store information in and retrieve it from memory.

In a state diagram, ____are used to represent states.

The model of a phenomenon must capture the full functionality of the real thing.

If a Turing machine program consists of the following four instructions: (1,0,1,2,R) (1,1,0,2,R) (2,0,0,2,R) (2,b,b,2,L) Then which of the following is a halting configuration?