Computability 1 Tao Jiang

First Page		Document Content
Date: 2002-01-28 23:36:37 Computability theory Theory of computation Turing machine Models of computation Theoretical computer science Computability Algorithm Halting problem Reduction Computable function NP Complexity class		Computability 1 Tao Jiang Add to Reading List Source URL: www.cs.ucr.edu Download Document from Source Website File Size: 220,30 KB Share Document on Facebook

	arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno Pauly DocID: 1sRZe - View Document
	A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi DocID: 1rjEK - View Document
	Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡ Abstract DocID: 1qlxM - View Document
	PDF Document DocID: 1pZ37 - View Document
	A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009 DocID: 1pMn0 - View Document