<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2006-10-06 14:59:22Mathematics Computer science Recursively enumerable set Turing reduction Computable function Recursive set Turing degree Computability Numbering Computability theory Theoretical computer science Theory of computation |
| 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 |