Exam 11: Models of Computation

A tape is used to hold the ____ to the Turing machine.

The ____ is the finite set of symbols that the Turing machine understands.

Each time a Turing machine operation is done, three actions take place.

The job of a ____ is to change 0s to 1s and 1s to 0s.

____ are used to detect errors that occur as a result of electronic interference when transmitting strings.

In unary representation, any unsigned whole number n will be encoded by a sequence of n + 1 1s.

The Turing machine contains two separate units that read one cell of the tape at a time and writes a symbol in that cell.

Consider the Turing machine instruction shorthand notation, (current state, current symbol, next symbol, next state, X) What does X represent?

State ____ is always the start-up state of the Turing machine.

A(n) ____ adds 1 to any number.

The ____ thesis can never be proved because the definition of an algorithm is descriptive, not mathematical.

A Turing machine ____ is a collection of instructions that allow a Turing machine to carry out a certain task.

The term unary means that we will use ____ symbol(s).

A Turing machine always contains a special symbol to represent "blank".

The bit inverter Turing machine should have only one state.

One consequence of an unsolvable problem related to the halting problem is that no program can be written to decide whether any given program always stops eventually, no matter what the input.

The Turing machine is designed to carry out two types of primitive operations.

A(n) ____ is a visual representation of a Turing machine algorithm.

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

You can think of a Turing machine as having an internal clock. Each tick of the clock performs a sequence of instructions.