Next:
r.e. languages enumerable by
Up:
Recursive and Recursively Enumerable
Previous:
Recursive and Recursively Enumerable
Recursively Enumerable Languages
r.e. languages enumerable by TMs
Enumeration means listing only valid strings
Some r.e. languages have no always-halting TM
TMs always halt for
w
in
L
(
M
)
Recursive Languages
Recursive languages = TMs that always halt
root
6/10/1998
