Degrees of Unsolvability of Continuous Functions

Journal of Symbolic Logic 69 (2):555 - 584 (2004)
We show that the Turing degrees are not sufficient to measure the complexity of continuous functions on [0, 1]. Computability of continuous real functions is a standard notion from computable analysis. However, no satisfactory theory of degrees of continuous functions exists. We introduce the continuous degrees and prove that they are a proper extension of the Turing degrees and a proper substructure of the enumeration degrees. Call continuous degrees which are not Turing degrees non-total. Several fundamental results are proved: a continuous function with non-total degree has no least degree representation, settling a question asked by Pour-El and Lempp; every non-computable f $\epsilon \mathcal{C}[0, 1]$ computes a non-computable subset of $\mathbb{N}$ ; there is a non-total degree between Turing degrees $a _\eqslantless_{\tau}$ b iff b is a PA degree relative to a; $\mathcal{S} \subseteq 2^{\mathbb{N}}$ is a Scott set iff it is the collection of f-computable subsets of $\mathbb{N}$ for some f $\epsilon \mathcal{C}[O, 1]$ of non-total degree; and there are computably incomparable f, g $\epsilon \mathcal{C}[0, 1]$ which compute exactly the same subsets of $\mathbb{N}$ . Proofs draw from classical analysis and constructive analysis as well as from computability theory
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1082418543
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,840
Through your library
References found in this work BETA
Definability in the Enumeration Degrees.Theodore A. Slaman & W. Hugh Woodin - 1997 - Archive for Mathematical Logic 36 (4-5):255-267.
Arithmetical Reducibilities I.Alan L. Selman - 1971 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 17 (1):335-350.
Arithmetical Reducibilities I.Alan L. Selman - 1971 - Mathematical Logic Quarterly 17 (1):335-350.

Add more references

Citations of this work BETA
Effectively Closed Sets of Measures and Randomness.Jan Reimann - 2008 - Annals of Pure and Applied Logic 156 (1):170-182.
On Turing Degrees of Points in Computable Topology.Iraj Kalantari & Larry Welch - 2008 - Mathematical Logic Quarterly 54 (5):470-482.
Cone Avoidance and Randomness Preservation.Stephen G. Simpson & Frank Stephan - 2015 - Annals of Pure and Applied Logic 166 (6):713-728.

Add more citations

Similar books and articles
Maximal Contiguous Degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
Degrees of Continuous Functionals.Peter G. Hinman - 1973 - Journal of Symbolic Logic 38 (3):393-395.
Weak Presentations of Computable Fields.Carl G. Jockusch Jr & Alexandra Shlapentokh - 1995 - Journal of Symbolic Logic 60 (1):199 - 208.
Bi-Isolation in the D.C.E. Degrees.Guohua Wu - 2004 - Journal of Symbolic Logic 69 (2):409 - 420.
Mass Problems and Randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
Wtt-Degrees and T-Degrees of R.E. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
Jump Operator and Yates Degrees.Guohua Wu - 2006 - Journal of Symbolic Logic 71 (1):252 - 264.
Jumping to a Uniform Upper Bound.Harold T. Hodes - 1982 - Proceedings of the American Mathematical Society 85 (4):600-602.
A Hierarchy for the Plus Cupping Turing Degrees.Yong Wang & Angsheng Li - 2003 - Journal of Symbolic Logic 68 (3):972-988.
A Model with No Magic Set.Krzysztof Ciesielski & Saharon Shelah - 1999 - Journal of Symbolic Logic 64 (4):1467-1490.
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
On the Structures Inside Truth-Table Degrees.Frank Stephan - 2001 - Journal of Symbolic Logic 66 (2):731-770.

Monthly downloads

Added to index


Total downloads

13 ( #357,754 of 2,178,194 )

Recent downloads (6 months)

1 ( #316,497 of 2,178,194 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums