Questions in Recursion Theory December 1997 This is an informal list of some open problems in recursion theory. Solutions and new questions are welcome, as well as corrections to the attributions given below. Please, sen

First Page		Document Content
Date: 2002-11-21 07:33:52 Mathematics Recursively enumerable set Turing degree Maximal set Creative and productive sets Simple set Low High Recursive set Computability theory Theoretical computer science Mathematical logic		Questions in Recursion Theory December 1997 This is an informal list of some open problems in recursion theory. Solutions and new questions are welcome, as well as corrections to the attributions given below. Please, sen Add to Reading List Source URL: math.berkeley.edu Download Document from Source Website File Size: 172,16 KB Share Document on Facebook

	Types and Type-Free λ-Calculus Dana S. Scott, FBA, FNAS University Professor Emeritus Carnegie Mellon University Visiting Scholar DocID: 1qIWA - View Document
	1 Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars DocID: 1oACi - View Document
	Fifth Internation Conference on Computability and Complexity in Analysis August 21-24, 2008, Hagen, Germany provisional programme DocID: 1nExD - View Document
	THEOREM OF THE DAY The DPRM Theorem Every recursively enumerable set is Diophantine. A set is recursively enumerable if there exists some (possibly non-terminating) algorithm which lists precisely the members of the set. DocID: 1msks - View Document
	Randomness and Universal Machines Santiago Figueira∗ Frank Stephan† Guohua Wu‡ DocID: 1fH94 - View Document