TOC Sns PDF
TOC Sns PDF
/
m
co
y.
bl
UNIT-I CHURCH-TURING THESIS
ee
.w
1. What is aTuring Machine?
k9
Turing machine is a simple mathematical model of a computer. TM has unlimited
e2
an unrestricted memory and is a much more accurate model of a general purpose
cs
computer. The turing machine is a FA with a R/W Head. It has an infinite tape
m
2. What are the difference between finite automata and Turing Machines?
tp
Turing machine can change symbols on its tape, whereas the FA cannot change
ht
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.
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.
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
/
m
co
7. What is a multitape TM?
y.
A multi-tape Turing machine consists of a finite control with k-tape heads and
bl
ktapes each tape is infinite in both directions. On a single move depending on the state
ee
of finite control and symbol scanned by each of tape heads ,the machine can change
state print a new symbol on each cells scanned by tape head, move each of its tape
.w
head independently one cell to the left or right or remain stationary.
k9
e2
8. Define nondeterministic TM?
cs
state
tp
9. What is an algorithm?
ht
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=6x3yz2
Formal description.
Implementation description.
High-level description.
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
/
m
co
y.
bl
ee
.w
15. Define universal Turing machine.
k9
e2
A universal Turing machine (UTM) is a TM which is capable of simulating any
cs
The diagonalization language consists of all strings w such that the TM whose
code is w does not accept when w is given as input.
tp
ht
17. Why some languages are not decidable or even Turing – recognizable?
The reason that there are uncountable many languages yet only countably
many Turing machines. Because each Turing machine can recognize a single
language and there are more languages than Turing machines, some languages are not
recognizable by any Turing machine.
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
BIG QUESTIONS
/
m
4. Explain how a TM can be used to determine the given number is prime or not?
co
5. Prove that if L is recognized by a TM with a two way infinite tape if it is
y.
bl
recognized by a TM with a one way infinite tape
ee
6. Prove that Halting problem is undecidable.
.w
7. Design a Turing machine that accepts the language L={an bn cn /n>1}
k9
8. What are the various models of Turing Machine?
e2
cs
9. With an example explain the universal Turing machine
m
recognizable.
tp
ht
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.
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
/
m
co
6. Write down the algorithm that decides ALBA?
y.
bl
The algorithm that decides ALBA is as follows:
ee
1. L=” on input {M,w} Where M is an LBA and w is a string .
1.1 Simulate M on w for qng^n steps until it halts
.w
1.2 If M has halted accept if it has accepted and reject if it has rejected . If it has
not halted , reject”.
k9
e2
cs
Suppose consider the input B and it has possible input C1,C2……. Cl. If B
gk
ants to check whether the Ci satisfy the three conditions of computational history
://
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.
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
MPCP = {<P>/P is an instance of the post correspondence with a match that starts
with the first domino}.
/
m
function on the tape and halting with the output of the function on the tape a function
co
f: €*€* is a computable function , if some turning machine M, on every input w,
y.
halts with just f(w) on its tape.
bl
ee
Eg: All arithmetic operations on integers.
.w
13. What is recursion theorem?
k9
e2
Let T be a Turing machine that computes a function t: €* x €*€*. There is
cs
a Turing machine R that computes a function r: €*€*, Where for every w :
r(w)=T(<R>,w).
m
The Turing machine that ignores its input and prints out a copy of its own
description, we call this as SELF.
There is a computable function q: €*€*, where for any string w, q(w) is the
description of a Turing machine Pw that prints out w and then halt.
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
/
m
21. What is called Sentence/Statement and Free variable?
co
A variable that isn’t bound within the scope of a quantifier is called a Free
y.
variable. A formula with no free variable is called a Sentence or Statement.
bl
ee
22. What is model?
A universe together with an assignment of relations to relation symbol is
.w
called a model .
k9
A model M is a tuple (U, P1,P2..Pk), where U is the universe and P1 through
e2
Pk are the relations assigned to symbols R1 through Rk.
cs
Language of a model is the collection of formulae that use only the relational
gk
symbols the model assign and that use each relation symbol with the correct arity.
://
model.
ht
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
B= 11101110111000111
Sequence A contain little information because it is merely a repetition of
pattern 01 twenty times. In contrast sequence B appears to contain more information.
/
m
where k(x) – length of the minimal description of x.
co
The definition of k(x) is intended to capture the amount of information in the
y.
string x.
bl
ee
31. When an x is a C-compressible?
Let x be a string, say that x is C-compressible if k(x) <= |x| - C.
.w
k9
BIG QUESTIONS
e2
cs
1. Explain how Post correspondence problem is undecidable?
m
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
1.Define complexity
• Complexity Theory = study of what is computationally feasible (or tractable)
with limited resources:
– running time
/
m
co
– storage space
y.
– number of random bits
bl
ee
– degree of parallelism
.w
– rounds of interaction
k9
e2
cs
others…
m
gk
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
• Theta (Q) notation is used when an algorithm can be bounded both from
above and below by the same function
/
m
• Little oh (o) defines a loose upper bound.
co
y.
7. What is Hamiltonian path?
bl
A Hamiltonian path in a directed graph G is a directed path that goes through
ee
each
.w
node exactly once. We consider a special case of this problem where the start node
k9
and target node are fixed. e2
8. Defines brute –force search
cs
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
/
time turing machine exists that halts with just f(w) on its tape. when started on
m
co
any input w.
y.
15. Define polynomial time mapping reducible.
bl
We say that A is polynomial time mapping reducible, or simply polynomial
ee
.w
time reducible, to B, written A≤
≤PB, if a polynomial time computable function f: Σ*
→ Σ* exists s.t. for every string w∈
∈Σ*, w∈
k9
∈A iff f(w)∈
∈B. Such a function f is
e2
called a polynomial time reduction of A to B.
cs
(x ∨ y ∨ z) ∧ (x ∨ z ∨ t) ∧ (x ∨ y ∨ t) ∧ (z ∨
BIG QUESTIONS
http://gkmcse2k9.weebly.com/
THOERY OF COMPUTATION
/
m
12. Prove that every context-free language is a member of P.
co
y.
13. Explain with an example CLASS-NP?
bl
ee
.w
UNIT-IV-
k9
e2
1. Define space complexity?
cs
m
gk
://
tp
ht
http://gkmcse2k9.weebly.com/