Professional Documents
Culture Documents
COMPUTABILITY AND
COMPLEXITY
Decidability
• When Turing Machine reaches at some final state it
“HALTS”.
• There are TMs that never halt on some inputs in any
state.
• So distinction between language can be made as:-
– TM that Halts on all input strings.
– Tm that never Halts on some input string.
Halting Problem of Turing Machine
Post Correspondence Problem
Computability
• The Problem of finding out whether a given
problem is “Solvable” by automata reduces to
the evaluation of function on the set of
natural numbers or a given alphabet by
mechanical means.
Primitive Recursion Function
• Consider the function exp(x, y) = xy
• x0 = 1
• x1 = x
• x2 = x . x
• … xy = x. x. x……( y occurences of x)
• xy+1 = x . x y
• The two Rewriting Rules:-
• X0 = 1
• Xy+1 = x. xy