Recursively Enumerable and Recursive Languages: A. Senthil - Professor/CSE 1

Recursively Enumerable
and
Recursive Languages
A. Senthil - Professor/CSE
1
Definition:
A language is recursively enumerable
if some Turing machine accepts it
2
Let L be a recursively enumerable language
and M the Turing Machine that accepts it
For string w:
if w L then M halts in a final state
if w L then M halts in a non-final state

or loops forever
3
Definition:
A language is recursive
if some Turing machine accepts it
and halts on any input string
In other words:
A language is recursive if there is
a membership algorithm for it
4
Let L be a recursive language
and M the Turing Machine that accepts it
For string w:
if w L then M halts in a final state
if w L then M halts in a non-final state
5
Computing Functions
with
Turing Machines
A. Senthil - Professor/CSE 6
A function f (w) has:
Domain: D Result Region: S
f (w)
w D f ( w)  S
A function may have many parameters:
Example: Addition function
f ( x, y )  x  y
Integer Domain
Decimal: 5
Binary: 101
Unary: 11111
We prefer unary representation:
easier to manipulate with Turing machines

Definition:
A function f is computable if
there is a Turing Machine M such that:
Initial configuration Final configuration

 w   f (w) 
q0 initial state q f final state
For all w D Domain

In other words:
A function f is computable if
there is a Turing Machine M such that:

q0 w  q f f ( w)
Initial Final
Configuration Configuration
For all w D Domain

Example
The function f ( x, y )  x  y is computable
x, y are integers
Turing Machine:
Input string: x0 y unary
Output string: xy 0 unary
x y
Start  1 1  1 0 1  1 
q0
initial state
The 0 is the delimiter that

separates the two numbers
x y
Start  1 1  1 0 1  1 
q0 initial state
x y
Finish  1 1  1 1 0 
q f final state
The 0 helps when we use
the result for other operations
x y
Finish  1 1  1 1 0 
q f final state
Turing machine for function f ( x, y )  x  y
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Execution Example: Time 0
x y
x  11 (2)
 1 1 0 1 1 
y  11 (2) q0
Final Result
x y
 1 1 1 1 0 
q4
Time 0  1 1 0 1 1 
q0
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 1  1 1 0 1 1 
q0
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 2  1 1 0 1 1 
q0
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 3  1 1 1 1 1 
q1
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 4  1 1 1 1 1 
q1
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 5  1 1 1 1 1 
q1
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 6  1 1 1 1 1 
q2
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 7  1 1 1 1 0 
q3
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 8  1 1 1 1 0 
q3
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 9  1 1 1 1 0 
q3
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 10  1 1 1 1 0 
q3
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 11  1 1 1 1 0 
q3
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
q4
Time 12  1 1 1 1 0 
q4
1  1, R 1  1, R 1  1, L
q0 0  1, R q1   , L q 1  0, L q3
2
  , R
HALT & accept q4
Another Example
The function f ( x)  2 x is computable
x is integer
Turing Machine:
Input string: x unary
Output string: xx unary

x
Start  1 1  1 
q0 initial state
2x
Finish  1 1  1 1 1 
q f final state
Turing Machine Pseudocode for f ( x)  2 x
• Replace every 1 with $
• Repeat:
• Find rightmost $, replace it with 1
• Go to right end, insert 1
Until no more $ remain
Turing Machine for f ( x)  2 x
1  $, R 1  1, L 1  1, R
q0   , L q1 $  1, R q2
  , R   1, L
q3
Example
Start Finish
 1 1   1 1 1 1 
q0 q3
1  $, R 1  1, L 1  1, R
q0   , L q1 $  1, R q2
  , R   1, L
q3
Another Example
1 if x y
The function f ( x, y ) 
0 if x y
is computable
Turing Machine for
1 if x y
f ( x, y ) 
0 if x y
Input: x0 y
Output: 1 or 0
Turing Machine Pseudocode:
• Repeat
Match a 1 from x with a 1 from y
Until all of x or y is matched
• If a 1 from x is not matched

erase tape, write 1 ( x  y)
else
erase tape, write 0
( x  y) 38
Combining Turing Machines
Block Diagram
Turing
input output
Machine
Example: x  y if x  y
f ( x, y ) 
0 if x  y
x, y
Adder x y
x, y x y
Comparer
x y Eraser 0

Recursively Enumerable and Recursive Languages: A. Senthil - Professor/CSE 1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Recursively Enumerable and Recursive Languages: A. Senthil - Professor/CSE 1

Uploaded by

Copyright:

Available Formats

Recursively Enumerable

if w L then M halts in a non-final state

if w L then M halts in a final state

if w L then M halts in a non-final state

Domain: D Result Region: S

Example: Addition function

We prefer unary representation:

easier to manipulate with Turing machines

Initial configuration Final configuration

q0 initial state q f final state

For all w D Domain

For all w D Domain

The function f ( x, y )  x  y is computable

Input string: x0 y unary

Output string: xy 0 unary

The 0 is the delimiter that

The function f ( x)  2 x is computable

Input string: x unary

Output string: xx unary

• Replace every 1 with $

• Go to right end, insert 1

Until no more $ remain

Match a 1 from x with a 1 from y

Until all of x or y is matched

• If a 1 from x is not matched

You might also like