Abstract
To each computable enumerable (c.e.) set A with a particular enumeration {A s }s ∈ ω, there is associated a settling function m A (x), where m A (x) is the last stage when a number less than or equal to x was enumerated into A. In [7], R.W. Robinson classified the complexity of c.e. sets into two groups of complexity based on whether or not the settling function was dominant. An extension of this idea to a more refined ordering of c.e. sets was first introduced by Nabutovsky and Weinberger in [6] and Soare [9], for application to differential geometry. There they defined one c.e. set A to settling time dominate another c.e. set B (B > st A) if for every computable function f , for all but finitely many x, m B (x) > f(m A (x)). In [4] Csima and Soare introduced a stronger ordering, where B > sst A if for all computable f and g, for almost all x, m B (x) > f(m A (g(x))). We give a survey of the known results about these orderings, make some observations, and outline the open questions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cooper, S.B.: Computability Theory. Chapman & Hall/CRC, Boca Raton, FL (2004)
Csima, B.F.: Applications of Computability Theory to Prime Models and Differential Geometry, Ph.D. thesis, The University of Chicago (2003)
Csima, B.F., Shore, R.A.: The Settling-Time Reducibility Ordering. Journal of Symbolic Logic 71(4), 1394–1410 (2006)
Csima, B.F., Soare, R.I.: Computability Results Used in Differential Geometry, Journal of Symbolic Logic (To appear)
Martin, D.A.: Classes of recursively enumerable sets and degrees of unsolvability. Z. Math. Logik Grundlagen Math. 12, 295–310 (1966)
Nabutovsky, A., Weinberger, S.: The Fractal Nature of Riem/Diff I. Geometrica Dedicata 101, 1–54 (2003)
Robinson, R.W.: A dichotomy of the recursively enumerable sets. Z. Math. Logik Grundlag. Math. 14, 339–356 (1968)
Soare, R.I.: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Springer, Heidelberg (1987)
Soare, R.I.: Computability theory and differential geometry. Bull. Symb. Logic 10, 457–486 (2004)
Soare, R.I.: Computability Theory and Applications, Springer, Heidelberg (To appear)
Weinberger, S.: Computers, rigidity and moduli. The large scale fractal geometry of Reimannian moduli space (M.B. Porter Lectures). Princeton UNiversity Press, Princeton NJ (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Csima, B.F. (2007). Comparing C.E. Sets Based on Their Settling Times. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)