Filters
Question type

Explain how a Turing machine differs in scale from any real computing agent.

Correct Answer

verifed

verified

A Turing machine is different in scale f...

View Answer

The bit inverter Turing machine should have two states. _________________________

A) True
B) False

Correct Answer

verifed

verified

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

Correct Answer

verifed

verified

A model of such a phenomenon:
•Captures ...

View Answer

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

verifed

verified

The Turing machine must know which opera...

View Answer

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


A) parity bit
B) model
C) state diagram
D) incrementer

E) B) and C)
F) All of the above

Correct Answer

verifed

verified

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


A) unsolvable
B) mechanical
C) indisputable
D) observable

E) None of the above
F) A) and C)

Correct Answer

verifed

verified

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

Correct Answer

verifed

verified

•No program can be written to decide whe...

View Answer

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.

Correct Answer

verifed

verified

We can write a Turing machine to add 1 to any number; such a machine is often called a(n) ____.


A) unary operator
B) bit adder
C) parity machine
D) incrementer

E) B) and C)
F) B) and D)

Correct Answer

verifed

verified

Models can only give us information about existing phenomena.

A) True
B) False

Correct Answer

verifed

verified

The real value of Turing machines as models of computability is in exposing problems that are ____________________.

Correct Answer

verifed

verified

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

A) True
B) False

Correct Answer

verifed

verified

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


A) Church-Zimmerman
B) Church-Turing
C) Church-Alan
D) Alan-Zimmerman

E) All of the above
F) A) and D)

Correct Answer

verifed

verified

A Turing machine includes a(n) tape that extends infinitely in both directions. _________________________

A) True
B) False

Correct Answer

verifed

verified

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

Correct Answer

verifed

verified

It must be able to all of the following:...

View Answer

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


A) blank
B) placeholder
C) alphabetic
D) nonblank

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

Correct Answer

verifed

verified

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

A) True
B) False

Correct Answer

verifed

verified

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


A) Church-Turing thesis
B) Church-Alan theorem
C) Church-Zimmerman thesis
D) Alan-Zimmerman thesis

E) None of the above
F) C) and D)

Correct Answer

verifed

verified

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 C)
F) All of the above

Correct Answer

verifed

verified

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

A) True
B) False

Correct Answer

verifed

verified

Showing 21 - 40 of 49

Related Exams

Show Answer