Question 1

The equation for the distance d that a moving vehicle travels - the product of rate r and time t - is considered to be a model.

Accepted Answer

A) True 
 B)False

Question 2

In a state diagram, ____ represent transitions from one state to another.

Accepted Answer

A)   rectangles
B)   circles
C)   triangles
D)   arrowsE) A) and B)
F) B) and C)

Question 3

A Turing machine cannot produce output.

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

A)   blank
B)   placeholder
C)   alphabetic
D)   nonblankE) A) and D)
F) A) and C)

Question 5

The Turing machine must execute instructions in the order that the instructions are numbered.

Accepted Answer

A) True 
 B)False

Question 6

A distinction must be made between a Turing machine as a computing agent and the algorithm it carries out.

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

A)   computability
B)   solubility
C)   compatibility
D)   correspondenceE) All of the above
F) A) and D)

Question 9

What can be done by an algorithm cannot be done by a Turing machine.

Accepted Answer

A) True 
 B)False

Question 10

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 which of the following is a halting configuration?

Accepted Answer

A)   ... b 1 1 b b b ... (current state = 2, symbol 1 is being read) 
B)   ... b 1 1 b b b ... (current state = 1, symbol 1 is being read) 
C)   ... b 1 0 b b b ... (current state = 1, symbol 0 is being read) 
D)   ... b 1 0 b b b ... (current state = 2, symbol 0 is being read) E) A) and D)
F) A) and C)

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

A Turing machine can store information in and retrieve it from memory.

Accepted Answer

A) True 
 B)False

Question 13

In a state diagram, ____are used to represent states.

Accepted Answer

A)   arrows
B)   circles
C)   rectangles
D)   trianglesE) B) and D)
F) B) and C)

Question 14

Bit inversion is an algorithm that a Turing machine can process.

Accepted Answer

A) True 
 B)False

Question 15

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

Accepted Answer

A)   Church-Turing thesis
B)   Church-Alan theorem
C)   Church-Zimmerman thesis
D)   Alan-Zimmerman thesisE) C) and D)
F) None of the above

Question 16

Which of the following statements is correct?

Accepted Answer

A)   scientists still think it is necessary to write a Turing machine when they talk about an algorithmic computation
B)   a Turing machine that is executing an algorithm to solve some task must halt when begun on a tape containing input appropriate to that task
C)   a Turing machine that is executing an algorithm to solve some task need not halt when begun on a tape containing input appropriate to that task
D)   just running the Turing machine enables us to decide about haltingE) B) and D)
F) A) and B)

Question 17

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

Accepted Answer

A) True 
 B)False

Question 18

The Turing machine captures all of the properties that are essential for a computing agent.

Accepted Answer

A) True 
 B)False

Question 19

The proof by ____ approach assumes that a conclusion is true and shows that the assumption leads to an impossible situation.

Accepted Answer

A)   contradiction
B)   inference
C)   deduction
D)   impossibilityE) A) and B)
F) None of the above

Question 20

The model of a phenomenon must capture the full functionality of the real thing.

Accepted Answer

A) True 
 B)False

Exam 11: Models of Computation

The Turing machine must execute instructions in the order that the instructions are numbered.

Correct AnswerverifiedShow Answer

Bit inversion is an algorithm that a Turing machine can process.

Correct AnswerverifiedShow Answer

The model of a phenomenon must capture the full functionality of the real thing.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

A Turing machine cannot produce output.

Correct AnswerverifiedShow Answer

In a state diagram, ____ represent transitions from one state to another.

Correct AnswerverifiedShow Answer

A distinction must be made between a Turing machine as a computing agent and the algorithm it carries out.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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 which of the following is a halting configuration?

Correct AnswerverifiedShow Answer

The Turing machine captures all of the properties that are essential for a computing agent.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

A Turing machine can store information in and retrieve it from memory.

Correct AnswerverifiedShow Answer

The equation for the distance d that a moving vehicle travels - the product of rate r and time t - is considered to be a model.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Which of the following statements is correct?

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

In a state diagram, ____are used to represent states.

Correct AnswerverifiedShow Answer

What can be done by an algorithm cannot be done by a Turing machine.

Correct AnswerverifiedShow Answer

The proof by ____ approach assumes that a conclusion is true and shows that the assumption leads to an impossible situation.

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified