Turing Machines Flashcards

1
Q

What is a turing machine

A
  • Model of computation which can describe all computers
  • Different variations to describe a Turing machine
  • Has an infinite ‘tape’ data structure
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the limitations of a turing machine

A
  • UTM is hardwired
  • Can only execute only one program
  • But real computers are re-programmable
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are the different components of a turing machine?

A
  • Infinite Tape
    • Acts as memory
    • Each cells contains one symbol
  • Read write head
    • Connected to CU
    • Can move from one location left or right
  • State Register
    • Stores the state of the machine
  • Finite table of instructions
    • Can erase or write a symbol
    • Move the head left, right or not at all
    • Go to new state or stay in the same state
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Describe the tape data structure

A
  • Tape is divided into cells
    • Each cell contains on symbol
  • Symbols can be from the alphabet and can be Σ ={0,1, a, b, x, $, etc}
  • Δ (delta) = empty or blank cell
  • Head can read, write and can move left or right one cell at a time
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Describe how a turing machine works

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Define a turing machine

A

Defined using 7 tuples

How well did you know this?
1
Not at all
2
3
4
5
Perfectly