Question 1

A Turing machine cannot produce output.

Accepted Answer

A) True 
 B)False  False

Question 2

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

Accepted Answer

A)  program 
B)  sequence 
C)  algorithm 
D)  tape 
A)  program 
B)  sequence 
C)  algorithm 
D)  tape A

Question 3

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  False

Question 4

Given that we can make a comparison between two Turing machine algorithms for the same task, can we compare the efficiency of a Turing machine algorithm with one that runs on a "real" computer?

Accepted Answer

Although we can compare two Turing machi

Question 5

According to its definition, what must an algorithm be or do?

Accepted Answer

An algorithm must:
•Be a well-

Question 6

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

Accepted Answer

A)  state bit 
B)  odd parity bit 
C)  inverted bit 
D)  sentinel bit 
A)  state bit 
B)  odd parity bit 
C)  inverted bit 
D)  sentinel bit

Question 7

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

Accepted Answer

A)  algorithm 
B)  contradiction 
C)  thesis 
D)  5-tuple 
A)  algorithm 
B)  contradiction 
C)  thesis 
D)  5-tuple

Question 8

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

Accepted Answer

A)  alphabet 
B)  input 
C)  output 
D)  halting state 
A)  alphabet 
B)  input 
C)  output 
D)  halting state

Question 9

The proof by ____ approach assumes that a specific Turing machine does exist and then shows that this assumption leads to an impossible situation.

Accepted Answer

A)  contradiction 
B)  inference 
C)  deduction 
D)  impossibility 
A)  contradiction 
B)  inference 
C)  deduction 
D)  impossibility

Question 10

Although we can compare two Turing machine algorithms for the same task, we can't really compare the efficiency of a Turing machine algorithm with an algorithm that runs on a "real" computer.

Accepted Answer

A) True 
 B)False

Question 11

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

Accepted Answer

A)  alphabet 
B)  placeholder 
C)  blank 
D)  palette 
A)  alphabet 
B)  placeholder 
C)  blank 
D)  palette

Question 12

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 13

Unsolvable problems related to the halting problem have the following practical consequence: ____.

Accepted Answer

A)  a program can be written to decide whether any given program run on any given input will produce some specific output 
B)  a program can be written to decide whether any two programs are equivalent 
C)  a program can be written to decide whether any given program always stops eventually, no matter what the input 
D)  no program can be written to decide whether any given program run on any given input will ever produce some specific output 
A)  a program can be written to decide whether any given program run on any given input will produce some specific output 
B)  a program can be written to decide whether any two programs are equivalent 
C)  a program can be written to decide whether any given program always stops eventually, no matter what the input 
D)  no program can be written to decide whether any given program run on any given input will ever produce some specific output

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

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

Accepted Answer

The answer of A computing agent must be able to...

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

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

Accepted Answer

The answer of There is no limit to the amount...

Question 18

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

Accepted Answer

A)  computable problem 
B)  impossible situation 
C)  unsolved problem 
D)  complex solution 
A)  computable problem 
B)  impossible situation 
C)  unsolved problem 
D)  complex solution

Question 19

In binary representation, any unsigned whole number n is encoded by a sequence of n + 1 1s. _________________________

Accepted Answer

A) True 
 B)False

Question 20

If we post a program and try to construct a Turing machine to solve it but are not successful, does this prove that no Turing machine exists? If not, why would prove this?

Accepted Answer

If we pose a problem and try to construc

A Turing machine cannot produce output.

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

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

Given that we can make a comparison between two Turing machine algorithms for the same task, can we compare the efficiency of a Turing machine algorithm with one that runs on a "real" computer?

According to its definition, what must an algorithm be or do?

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

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

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

The proof by ____ approach assumes that a specific Turing machine does exist and then shows that this assumption leads to an impossible situation.

Although we can compare two Turing machine algorithms for the same task, we can't really compare the efficiency of a Turing machine algorithm with an algorithm that runs on a "real" computer.

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

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.

Unsolvable problems related to the halting problem have the following practical consequence: ____.

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

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

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

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

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

In binary representation, any unsigned whole number n is encoded by a sequence of n + 1 1s. _________________________

If we post a program and try to construct a Turing machine to solve it but are not successful, does this prove that no Turing machine exists? If not, why would prove this?

An Introduction to Computer Science

Algorithm Discovery and Design

The Efficiency of Algorithms

The Building Blocks: Binary Numbers, Boolean Logic, and Gates

Computer Systems Organization

An Introduction to System Software and Virtual Machines

Computer Networks, The Internet, and the World Wide Web

Information Security

Introduction to High-Level Language Programming

The Tower of Babel

Compilers and Language Translation

Simulation and Modeling

Electronic Commerce and Databases

Artificial Intelligence

Computer Graphics and Entertainment: Movies, Games, and Virtual Communities

Making Decisions About Computers, Information, and Society

Filters

Exam 12: Models of Computation

A Turing machine cannot produce output.

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

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

Given that we can make a comparison between two Turing machine algorithms for the same task, can we compare the efficiency of a Turing machine algorithm with one that runs on a "real" computer?

According to its definition, what must an algorithm be or do?

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

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

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

The proof by ____ approach assumes that a specific Turing machine does exist and then shows that this assumption leads to an impossible situation.

Although we can compare two Turing machine algorithms for the same task, we can't really compare the efficiency of a Turing machine algorithm with an algorithm that runs on a "real" computer.

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

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.

Unsolvable problems related to the halting problem have the following practical consequence: ____.

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

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

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

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

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

In binary representation, any unsigned whole number n is encoded by a sequence of n + 1 1s. _________________________

If we post a program and try to construct a Turing machine to solve it but are not successful, does this prove that no Turing machine exists? If not, why would prove this?

An Introduction to Computer Science

Algorithm Discovery and Design

The Efficiency of Algorithms

The Building Blocks: Binary Numbers, Boolean Logic, and Gates

Computer Systems Organization

An Introduction to System Software and Virtual Machines

Computer Networks, The Internet, and the World Wide Web

Information Security

Introduction to High-Level Language Programming

The Tower of Babel

Compilers and Language Translation

Simulation and Modeling

Electronic Commerce and Databases

Artificial Intelligence

Computer Graphics and Entertainment: Movies, Games, and Virtual Communities

Making Decisions About Computers, Information, and Society

Filters