<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2002-01-28 23:36:37Computability theory Theory of computation Turing machine Models of computation Theoretical computer science Computability Algorithm Halting problem Reduction Computable function NP Complexity class |
Add to Reading List |
Computability 1 Tao Jiang![arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno Pauly](https://www.pdfsearch.io/img/931faa11999bb5e62c13de7cf5af35fb.jpg "arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno Pauly") | arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno PaulyDocID: 1sRZe - View Document |
 | A brief introduction to Higher Order Logic and the HOL proof assistant Monica NesiDocID: 1rjEK - View Document |
 | Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡ AbstractDocID: 1qlxM - View Document |
 | PDF DocumentDocID: 1pZ37 - View Document |
 | A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009DocID: 1pMn0 - View Document |