FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 12: Models of Computation

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 21

True/False

Review LaterAdd Note

Review Later

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

A) True
B) False

Correct Answer

verified

Show Answer

Question 22

Multiple Choice

Review LaterAdd Note

Review Later

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

A) computability
B) extensibility
C) compatibility
D) correspondence

E) A) and B)
F) A) and C)

Correct Answer

verified

Show Answer

Question 23

Essay

Review LaterAdd Note

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

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

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

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

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.

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

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

Models can only give us information about existing phenomena.

Describe in detail what a Turing machine includes.

Discuss some real world uses for a bit inverter.

Every problem has an algorithmic solution.

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

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

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

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

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

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

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