First Page | Document Content | |
---|---|---|
Date: 2015-10-12 16:05:50Computability theory Theory of computation Turing machine Alan Turing Models of computation Computability ChurchTuring thesis Computable function Algorithm Reduction Turing completeness Machine that always halts | Computational Irreducibility and Computational AnalogyAdd to Reading ListSource URL: www.complex-systems.comDownload Document from Source WebsiteFile Size: 202,27 KBShare Document on Facebook |
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 |