First Page | Document Content | |
---|---|---|
Date: 2011-01-10 14:18:09Computer science Mathematics Alan Turing Turing machine Church–Turing thesis Computable function Halting problem Computable number Computability Computability theory Theory of computation Theoretical computer science | Alan Turing: the logical and physical basis of computing Andrew Hodges∗ Wadham College, University of Oxford, Oxford OX1 3PN, U.K. This paper is based on the talk given on 5 June 2004 at the conference at Manchester UnAdd to Reading ListSource URL: www.bcs.orgDownload Document from Source WebsiteFile Size: 173,61 KBShare Document on Facebook |
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 | |
Microsoft Word - IBSAlgorithms.docDocID: 1p3sE - View Document | |
Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,DocID: 1oyBY - View Document |