Exam 12: Models of Computation

List three practical consequences arising from unsolvable programs related to the halting problem.

Discuss some real world uses for a bit inverter.

Every problem has an algorithmic solution.

A Turing machine includes a(n)infinite platter that can be stamped with only one symbol per sector. _________________________

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

Prototypes are an important way of studying many physical and social phenomena. _________________________

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

The model of a phenomenon does not need to capture the full functionality of the real thing.

An extra bit, called a(n)____, can be attached to the end of a string of bits.

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 the configuration ____ is a halting configuration.

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

Describe in detail what a Turing machine includes.

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

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

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

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

A Turing machine can produce output on the same tape upon which the input exists.

Models can only give us information about existing phenomena.

A(n)____ is a statement advanced for consideration and maintained by argument.

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