Turing Machine

Question 1

Turing machine

Answer 1

A model of a hypothetical machine which uses a predefined set of rules to determine a result from a set of inputs

Question 2

Infinite tape

Answer 2

A memory tape divided into cells with many memory locations

Question 3

Read-write head

Answer 3

A head that reads & write symbols on the tape and moves the tape left & right one cell at a time

Question 4

State register

Answer 4

Stores the state of the Turing machine

Question 5

Finite table of instructions

Answer 5

Specifies what to do for each combination of the current state and the symbol that is read

Question 6

Turing machine tuple: Q

Answer 6

Set of states

Question 7

Turing machine tuple: q0

Answer 7

Initial state

Question 8

Turing machine tuple: b

Answer 8

the blank symbol

Question 9

Turing machine tuple: Γ

Answer 9

Set of alphabets

Question 10

Turing machine tuple: Σ

Answer 10

Set of inputs (not include blanks)

Question 11

Turing machine tuple: F

Answer 11

Final state

Question 12

Turing machine tuple: δ

Answer 12

Transition function

Question 13

Limitation of Turing machine

Answer 13

They are hardwired so can only one program