UNIT=5
TURING MACHINES
1) Write about Churches hypothesis and Computable function in
Turing Machines with an example
2) Why a Turing machine is called Linear Bounded Automata?
Discuss the
Advantages of Linear Bounded Automata
3) Discuss the variants of Turing machines.
4) Explain the differences between Halt, Accept, and Decidable in
the context of Turing machines
5) Explain the differences between Turing Machine and Universal
Turing Machine.
6) Explain the general structure of multi tape and non-
deterministic Turing
Machines and show that these are equivalent to basic Turing
machines.
7) Explain about types of Turing Machine?
8) Discuss in brief about church hypothesis?
9) Explain about Universal Turing Machine?
10) Define Turing Machine? Explain about the Model of Turing
Machine?
UNIT-6
COMPUTABILITY
