Question 1

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 B

Question 2

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 thesis 
A)  Church-Turing thesis 
B)  Church-Alan theorem 
C)  Church-Zimmerman thesis 
D)  Alan-Zimmerman thesis A

Question 3

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

Accepted Answer

It must be able to all of the following:
•Accept input.
•Store information in and retrieve it from memory.
•Take actions according to algorithm instructions; the choice of what action to take may depend on the present state of the computing agent, as well as on the input item presently being processed.
•Produce output.

Question 4

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

Accepted Answer

A model of such a phenomenon:
•Captures

Question 5

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

Accepted Answer

A)  0 
B)  1 
C)  L 
D)  R 
A)  0 
B)  1 
C)  L 
D)  R

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

Models can only give us information about existing phenomena.

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

A) True 
 B)False

Question 9

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 10

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

Accepted Answer

A)  one 
B)  two 
C)  three 
D)  four 
A)  one 
B)  two 
C)  three 
D)  four

Question 11

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 12

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

Accepted Answer

The Turing machine must know which opera

Question 13

The bit inverter Turing machine should have two states._________________________

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

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

Question 16

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.

Accepted Answer

The answer of Each individual Turing machine instruction describes an...

Question 17

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

Accepted Answer

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

Question 18

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 19

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 20

Describe in detail what a Turing machine includes.

Accepted Answer

A Turing machine includes a (conceptual)

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

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

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

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

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

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

Models can only give us information about existing phenomena.

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

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

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

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

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

The bit inverter Turing machine should have two states._________________________

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

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

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 formal basis for proofs might allow for ____ theorem-proving.

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

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

Describe in detail what a Turing machine includes.

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 and Cloud Computing

Information Security

Introduction to High-Level Language Programming

The Tower of Babel

Compilers and Language Translation

Simulation and Modeling

Electronic Commerce, Databases, and Personal Privacy

Artificial Intelligence

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

Making Decisions About Computers, Information, and Society

Filters

Exam 12: Models of Computation

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

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

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

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

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

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

Models can only give us information about existing phenomena.

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

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

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

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

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

The bit inverter Turing machine should have two states._________________________

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

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

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 formal basis for proofs might allow for ____ theorem-proving.

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

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

Describe in detail what a Turing machine includes.

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 and Cloud Computing

Information Security

Introduction to High-Level Language Programming

The Tower of Babel

Compilers and Language Translation

Simulation and Modeling

Electronic Commerce, Databases, and Personal Privacy

Artificial Intelligence

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

Making Decisions About Computers, Information, and Society

Filters