Graduate studies at Western
|Abstract||Turing’s famous 1936 paper “On computable numbers, with an application to the Entscheidungsproblem” deﬁnes a computable real number and uses Cantor’s diagonal argument to exhibit an uncomputable real. Roughly speaking, a computable real is one that one can calculate digit by digit, that there is an algorithm for approximating as closely as one may wish. All the reals one normally encounters in analysis are computable, like π, √2 and e. But they are much scarcer than the uncomputable reals because, as Turing points out, the computable reals are countable, whilst the uncomputable reals have the power of the continuum. Furthermore, any countable set of reals has measure zero, so the computable reals have measure zero. In other words, if one picks a real at random in the unit interval with uniform probability distribution, the probability of obtaining an uncomputable real is unity. One may obtain a computable real, but that is in- ﬁnitely improbable. But how about individual examples of uncomputable reals? We will show two: H and the halting probability Ω, both contained in the unit interval. Their construction was anticipated in..|
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
|Through your library||Only published papers are available at libraries|
Similar books and articles
Alexander Raichev (2005). Relative Randomness and Real Closed Fields. Journal of Symbolic Logic 70 (1):319 - 330.
Rodney G. Downey & Evan J. Griffiths (2004). Schnorr Randomness. Journal of Symbolic Logic 69 (2):533 - 554.
George Barmpalias (2003). The Approximation Structure of a Computably Approximable Real. Journal of Symbolic Logic 68 (3):885-922.
Arnold W. Miller (1983). Mapping a Set of Reals Onto the Reals. Journal of Symbolic Logic 48 (3):575-584.
Johanna N. Y. Franklin (2010). Subclasses of the Weakly Random Reals. Notre Dame Journal of Formal Logic 51 (4):417-426.
Guido Gherardi (2011). Alan Turing and the Foundations of Computable Analysis. Bulletin of Symbolic Logic 17 (3):394-430.
Janusz Pawlikowski (2001). Cohen Reals From Small Forcings. Journal of Symbolic Logic 66 (1):318-324.
Michael Rescorla (2007). Church's Thesis and the Conceptual Analysis of Computability. Notre Dame Journal of Formal Logic 48 (2):253-280.
Alexander S. Kechris (1978). The Perfect Set Theorem and Definable Wellorderings of the Continuum. Journal of Symbolic Logic 43 (4):630-634.
Andreas Blass (1981). The Model of Set Theory Generated by Countably Many Generic Reals. Journal of Symbolic Logic 46 (4):732-752.
William C. Calhoun (2006). Degrees of Monotone Complexity. Journal of Symbolic Logic 71 (4):1327 - 1341.
Michael Moses (2010). The Block Relation in Computable Linear Orders. Notre Dame Journal of Formal Logic 52 (3):289-305.
Joseph S. Miller (2004). Degrees of Unsolvability of Continuous Functions. Journal of Symbolic Logic 69 (2):555 - 584.
Added to index2010-12-22
Total downloads2 ( #246,694 of 739,354 )
Recent downloads (6 months)0
How can I increase my downloads?