Lecture 7 - Models Of Computation

Question 1

What do models of computation attempt to do?

Answer 1

define the black box

Question 2

What are the 3 models we will look at?

Answer 2

• finite state automata
• pushdown automata
• turing machines

Question 3

Characteristics of FA?

Answer 3

• fixed amount of memory
• limited problem solving ability
• can only read forward
• mostly deterministic
• changes state based on input

Question 4

Characteristics of PA?

Answer 4

• unlimited memory
• behaves like a stack

Question 5

Characteristics of TMs?

Answer 5

• unlimited memory
• bidirectional reading
• same power as typical computer