Class 20

Recursively Enumerable and Recursive Languages
Courtesy Costas Busch - RPI
Definition: A language is recursively enumerable if some Turing machine accepts it
Let and
L be a recursively enumerable language M the Turing Machine that accepts it
For string if if
w:
then then
w L
w L
M halts in a final state
M halts in a non-final state

or loops forever
Courtesy Costas Busch - RPI 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

Let and
L be a recursive language M the Turing Machine that accepts it
For string if if
w:
then then
w L w L
M halts in a final state M halts in a non-final state

We will prove: 1. There is a specific language which is not recursively enumerable (not accepted by any Turing Machine)
2. There is a specific language which is recursively enumerable but not recursive

Non Recursively Enumerable
Recursively Enumerable
Recursive
A Language which is not Recursively Enumerable
We want to find a language that is not Recursively Enumerable
This language is not accepted by any Turing Machine
Consider alphabet Strings:
{a}
a, aa, aaa, aaaa, a a

1 2
10
Consider Turing Machines that accept languages over alphabet
{a}
They are countable:
M1, M 2 , M 3 , M 4 , -
11
Example language accepted by M i
L( M i ) ! {aa, aaaa, aaaaaa} L( M i ) ! {a , a , a }

Alternative representation 2 4 6
. .
12
L( M i ) 0
a
L ( M1 ) L( M 2 )
a
0 0
a 1 1
. . . . .
13
1
0
1
0 0
L( M 3 )
L( M 4 )
1
0
1
0
1 1
Consider the language i i
L ! {a : a L( M i )}
L consists from the 1s in the diagonal

a
L ( M1 )
a 1
a 0
0
a 1 1
. . . . .
L( M 2 )
L( M 3 ) L( M 4 )
1 0 0
0 1 0
3
1 0
4
1 1
L ! {a , a ,- }
Consider the language i i
L ! {a : a L( M i )} L ! {a : a L( M i )}
L
consists of the 0s in the diagonal
a
L ( M1 )
a 0
0
a 1 1
. . . . .
1
0
L( M 2 )
L( M 3 ) L( M 4 )
1 0 0
1 0
1
1 0
2
1 1
L ! {a , a ,- }
Theorem: Language
L is not recursively enumerable
18
Proof: Assume for contradiction that
L is recursively enumerable
There must exist some machine that accepts L
Mk
L( M k ) ! L
a
L ( M1 ) L( M 2 )
a
0 0
a 1 1
. . . . .
0 1
0 0
1
0
L( M 3 )
L( M 4 )
1
0
1
0
1 1
Question: M k ! M1 ?
a
L ( M1 ) L( M 2 )
a
0 0
a 1 1
. . . . .
0 1
0 0
1
0
L( M 3 )
L( M 4 )
Answer:
1
0
1
0
1 1
1 1
M k { M1
a L( M k ) a L ( M1 )
21
a
L ( M1 ) L( M 2 )
a
0 0
a 1 1
. . . . .
0 1
0 0
1
0
L( M 3 )
L( M 4 )
1
0
1
0
1 1
Question: M k ! M 2 ?
a
L ( M1 ) L( M 2 )
a
0 0
a 1 1
. . . . .
0 1
0 0
1
0
L( M 3 )
L( M 4 )
Answer:
1
0
1
0
2 2
1 1
Mk { M2
a L( M k ) a L( M 2 )
23
a
L ( M1 ) L( M 2 )
a
0 0
a 1 1
. . . . .
0 1
0 0
1
0
L( M 3 )
L( M 4 )
1
0
1
0
1 1
Question: M k ! M 3 ?
a
L ( M1 ) L( M 2 )
a
0 0
a 1 1
. . . . .
0 1
0 0
1
0
L( M 3 )
L( M 4 )
Answer:
1
0
1
0
3 3
1 1
M k { M3
a L( M k ) a L( M 3 )
25
Similarly:
Mk { Mi
for any
Because either:
a L( M k ) a L( M i )
i
or
a L( M k ) a L( M i )
i
26
Therefore, the machine
M k cannot exist
Therefore, the language L is not recursively enumerable
End of Proof
Observation: There is no algorithm that describes
(otherwise L would be accepted by some Turing Machine)
28
L
Recursive
29
A Language which is Recursively Enumerable and not Recursive
30
We want to find a language which Is recursively enumerable But not recursive
There is a Turing Machine that accepts the language

The machine doesnt halt on some input

31
We will prove that the language
L ! {a : a L( M i )}
Is recursively enumerable but not recursive
32
a
L ( M1 )
a 1
a 0
0
a 1 1
. . . . .
L( M 2 )
L( M 3 ) L( M 4 )
1 0 0
0 1 0
3
1 0
4
1 1
L ! {a , a ,- }
Theorem: The language
L ! {a : a L( M i )}
is recursively enumerable
34
Proof: We will give a Turing Machine that accepts L
35
Turing Machine that accepts For any input string
w
i
Compute i , for which
w!a Find Turing machine M i
(using an enumeration procedure for Turing Machines)
Simulate If
M i on input a
End of Proof
M i accepts, then accept w

36
Observation: Recursively enumerable i i L ! {a : a L( M i )}
Not recursively enumerable i i L ! {a : a L( M i )}

(Thus, also not recursive)
Theorem: The language
L ! {a : a L( M i )}
is not recursive
38
Proof: Assume for contradiction that
L is recursive
Then
L is recursive: M that accepts L
Take the Turing Machine
M halts on any input:

If If
M accepts then reject M rejects then accept

Therefore:
L is recursive
But we know:
L is not recursively enumerable

thus, not recursive CONTRADICTION!!!!
Therefore,
is not recursive
End of Proof
L
L
Recursive
42
Turing acceptable languages and Enumeration Procedures
43
We will prove:
(weak result)
If a language is recursive then there is an enumeration procedure for it
(strong result)
A language is recursively enumerable if and only if there is an enumeration procedure for it

Theorem: if a language L is recursive then there is an enumeration procedure for it
45
Proof: Enumeration Machine
~ M
Enumerates all strings of input alphabet

Accepts
L
46
If the alphabet is {a, b} then ~ M can enumerate strings as follows:
a b aa ab ba bb aaa aab ......

Enumeration procedure Repeat:
~ generates a string w M M checks if w L

YES: print NO: ignore
w to output w
End of Proof
Example:
L ! {b, ab, bb, aaa,....}

L(M )
Enumeration Output
~ M
a b aa ab ba bb aaa aab ......
b ab bb aaa ......
b ab bb aaa ......
49
Theorem: if language L is recursively enumerable then there is an enumeration procedure for it
50
Proof: Enumeration Machine
~ M
Enumerates all strings of input alphabet

Accepts L
51
If the alphabet is {a, b} then ~ M can enumerate strings as follows:
a b aa ab ba bb aaa aab
NAIVE APPROACH Enumeration procedure Repeat:
~ generates a string w M M checks if w L

YES: print NO: ignore
w to output w
Problem: If w L machine M
may loop forever

53
BETTER APPROACH
~ Generates first string w M 1 M executes first step on w1 ~ Generates second string w M 2 M executes first step on w2
second step on
w1
54
~ Generates third string w M 3 M executes first step on w3

second step on third step on And so on............
w2 w1
55
w1
1 Step in string 2 3
w2
1 2 3
w3
1 2 3
w4
1 2 3
.
If for any string wi machine M halts in a final state then it prints wi on the output
End of Proof
Theorem: If for language L there is an enumeration procedure then L is recursively enumerable
58
Proof:
Input Tape
w
Machine that accepts L
Enumerator for L
Compare
59
Turing machine that accepts For input string Repeat:
Using the enumerator, generate the next string of
Compare generated string with If same, accept and exit loop

End of Proof
60
We have proven: A language is recursively enumerable if and only if there is an enumeration procedure for it
61

Class 20

Загружено:

Сведения о документе

Исходное описание:

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Class 20

Загружено:

Авторское право:

Доступные форматы

Recursively Enumerable and Recursive Languages

Courtesy Costas Busch - RPI

Definition: A language is recursively enumerable if some Turing machine accepts it

Courtesy Costas Busch - RPI

L be a recursively enumerable language M the Turing Machine that accepts it

M halts in a final state

M halts in a non-final state

In other words: A language is recursive if there is a membership algorithm for it

L be a recursive language M the Turing Machine that accepts it

M halts in a final state M halts in a non-final state

2. There is a specific language which is recursively enumerable but not recursive

Non Recursively Enumerable

Courtesy Costas Busch - RPI

A Language which is not Recursively Enumerable

Courtesy Costas Busch - RPI

We want to find a language that is not Recursively Enumerable

This language is not accepted by any Turing Machine

Courtesy Costas Busch - RPI

Consider alphabet Strings:

a, aa, aaa, aaaa, a a

Courtesy Costas Busch - RPI

Consider Turing Machines that accept languages over alphabet

They are countable:

Courtesy Costas Busch - RPI

Example language accepted by M i

L( M i ) ! {aa, aaaa, aaaaaa} L( M i ) ! {a , a , a }

Courtesy Costas Busch - RPI

Courtesy Costas Busch - RPI

Consider the language i i

L consists from the 1s in the diagonal

Consider the language i i

L is not recursively enumerable

Courtesy Costas Busch - RPI

Proof: Assume for contradiction that

There must exist some machine that accepts L

Courtesy Costas Busch - RPI

Courtesy Costas Busch - RPI

Courtesy Costas Busch - RPI

Courtesy Costas Busch - RPI

Therefore, the machine

Therefore, the language L is not recursively enumerable

Observation: There is no algorithm that describes

(otherwise L would be accepted by some Turing Machine)

Courtesy Costas Busch - RPI

Non Recursively Enumerable

Courtesy Costas Busch - RPI

A Language which is Recursively Enumerable and not Recursive

Courtesy Costas Busch - RPI

We want to find a language which Is recursively enumerable But not recursive

There is a Turing Machine that accepts the language

The machine doesnt halt on some input

We will prove that the language

Courtesy Costas Busch - RPI

Theorem: The language

Courtesy Costas Busch - RPI

Proof: We will give a Turing Machine that accepts L

Courtesy Costas Busch - RPI

Turing Machine that accepts For any input string

Compute i , for which

w!a Find Turing machine M i

(using an enumeration procedure for Turing Machines)

M i accepts, then accept w

Observation: Recursively enumerable i i L ! {a : a L( M i )}