Turing Machines and Type 0 Languages
Two theorems which show that the class of languages accepted by Turing machines is the class of Type 0 or recursively enumerable languages.

	Keyword	Results for this URL	Total searches