FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 12: Models of Computation

Show Answer

Share

---

All types

Filters

Study Flashcards

Question 1

Short Answer

Review LaterAdd Note

Review Later

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

Correct Answer

verified

Show Answer

Question 2

Essay

Review LaterAdd Note

Review Later

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

Correct Answer

verified

The Turing machine must know which opera...

View Answer

Show Answer

Question 3

Multiple Choice

Review LaterAdd Note

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 proof by ____ approach assumes that a specific Turing machine does exist and then shows that this assumption leads to an impossible situation.

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

The Turing machine contains two separate units, one for input and one for output.

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

Models can only give us information about existing phenomena.

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

A formal basis for proofs might allow for ____ theorem-proving.

The symbols for a Turing machine must come from a finite set of symbols called the tape ____.

We assumed that there was a Turing machine that could solve the halting problem, and this assumption led to a(n) ____.

What are four characteristics of the model of a physical or social phenomenon?

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

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.

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

Describe in detail what a Turing machine includes.

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

The bit inverter Turing machine should have two states._________________________

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