2. What are the difference between finite automata and Turing Machines?
Turing machine can change symbols on its tape, whereas the FA cannot change
symbols on tape. Also TM has a tape head that moves both left and right side
,whereas the FA doesn’t have such a tape head.
3. Define Turing Machine?
A turing machine is a 7-tuple (Q, Σ, , δ, q0, qaccept
, qreject) where
Q: finite set of states
Σ: input alphabet (cannot include blank symbol, _)
: tape alphabet, includes Σ and _
δ: transition function: Q × → Q × × {L, R}
q0: start state, q0 ∈ Q
qaccept: accepting state, qaccept ∈ Q
qreject: rejecting state, qreject ∈ Q
4. What is configuration?
Turing machine computes, changes occur in the current state, the current tape
contents and the current head location.a setting of these three items is called a
configuration.
10 What is a polynomial?
It is a sum of terms where each term is a product of certain variables and a
constant called a co-efficient.
Eg.6 x*x*x*y*z*z=6x
3
yz
2
UNIT-II REDUCIBILITY
1.What is reduction?
A reduction is a way of converting one problem into another in such a way
that a solution to the second problem can be used to solve the first problem.
2. What is reducibility?
The primary method of proving some problems are computationally unsolvable.
It is called reducibility.Reducibility always involves two problems which we call A
and B. If A reduces to B, we can use a solution to B to solve A.
Suppose consider the input B and it has possible input C1,C2……. Cl. If B
ants to check whether the Ci satisfy the three conditions of computational history
1. C1 is a start configuration for M on w
2. Each Ci+1 legally follows from Cp
3. Cl is an accepting configuration for M
The task is to make a list of the dominos; so that the string we get by reading
off the symbols on the top is same as the string of symbols on the bottom.This list is
called a match. For example: [a/ab][b/ca][ca/a][a/ab][abc/c].Reading off the top
strings we get abcaaabc , which is same as reading off the bottom.
BIG QUESTIONS
1. Explain how Post correspondence problem is undecidable?
2. Prove that HALTTM is undecidable.
3. Prove that ETM is undecidable.
4. Prove that REGULAR TM is undecidable.
5. Prove that EQ TM is undecidable.
6. Prove that A LBA is decidable.
7. Prove that E LBA is undecidable.
8. Prove that ALL CFG is undecidable.
9. State and prove PCP is undecidable.
10. Prove that EQ TM is neither Turing-recognizable nor co-Turing-recognizable.
11. State and prove recursion therorem
12. Explain self-reference in detail.
13. Explain decidability of logical theories?
14. Write a brief note on a decidable theory?
15. Write a brief note on an undecidable theory?
16. Explain Turing reducibility?
THOERY OF COMPUTATION
s
.
uch a bound are called exponential bounds when
is a real number greater than 0
Asymptotic Notation.
BIG QUESTIONS
1. Show that every CFL is a member of class P problem
2. Show that a language is in NP if it is decided by some non deterministic
polynomial time Turing machine.
3. Explain the cook-Levin theorem
4. Explain about the vertex cover problem.
5. Explain about Hamiltonian path problem.
6. Briefly discuss about the subset sum problem? THOERY OF COMPUTATION