<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2007-12-14 11:41:15Computability theory Theory of computation Turing machine Alan Turing Universal Turing machine Halting problem Computability Computable number Algorithm Theoretical computer science Applied mathematics Mathematics |
| 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 |