4.4.5 -ToC (A model of computation) Flashcards

1
Q

What is the universal turing machine

A
  • A turing machine
  • That can execute the behaviour of any other Turing machine
  • Can compute any computable sequence
  • Faithfully executes operations on the data precicely as the TM machine does
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Where are the instuction of the arbitary Turing Machine stored on the UTM

A
  • On its tape
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How does the UTM deal with the data and instructions from the TM

A
  • It acts as an interpreter
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is a turing machine

A
  • A computer with a single fixed program, which provides a general model of computation and a definition of what is computable
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What are the 4 features of a Turing Machine

A
  • A finite set of states in a state transition diagram
  • A finite alphabet of symbols
  • An infinite tape with marked-off squares
  • A sensing read-write head that can travel along the tape, one square at a time
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly