Next:
Recursive languages = TMs
Up:
Recursively Enumerable Languages
Previous:
TMs always halt for
Recursive Languages
Recursive languages = TMs that always halt
root
6/10/1998
