Abstract
We analyze the quantitative structure of Δ 02 . Among other things, we prove that a set is Turing complete if and only if its lower cone is non-negligible, and that the sets of r.e.-degree form a small subset of Δ 02 .
Research supported by a Marie Curie fellowship of the European Union under grant no. ERB-FMBI-CT98-3248.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Ambos-Spies and E. Mayordomo, Resource-bounded measure and randomness, in: A. Sorbi (ed.), Complexity, logic, and recursion theory, 1–47, Dekker, New York, 1997.
K. Ambos-Spies, E. Mayordomo, Y. Wang, X. Zheng, Resource-bounded balanced genericity, stochasticity and weak randomness,Proc. 13th Symp. on Theoret. Aspects of Comp. Sci., Lect. Notes in Comp. Sci. 1046 (1996) 63–74, Springer-Verlag.
K. Ambos-Spies, W. Merkle, J. Reimann, and S. A. Terwijn, Almost complete sets. Proc. 17th Symp. on Theoret. Aspects of Comp. Sci., Lect. Notes in Comp. Sci. 1770 (2000) 419–430, Springer-Verlag.
L. E. J. Brouwer, Begründung der Mengenlehre unabhängig vom logischen Satz vom ausgeschlossenen Dritten, Zweiter Teil, Verhandelingen Nederlandse Akademie van Wetenschappen, afd. Natuurk. Sect. 12, 7 (1919).
O. Demuth and A. Kučera, Remarks on 1-genericity, semigenericity and related concepts, Comment. Math. Univ. Carolinae, 28 (1987), 85–94.
Yu. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel (eds.), Handbook of Recursive Mathematics, Vol. 1 and 2, Elsevier, 1998.
R. I. Freidzon, Families of recursive predicates of measure zero, J. Soviet Math. 6 (1976), 449–455. Translated from Zap. Naucn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 32, (1972) 121–128.
S. C. Kleene and E. L. Post, The upper semi-lattice of degrees of recursive unsolvability, Ann. of Math. (2) 59 (1954) 379–407.
A. Kucera, Measure, *classes and complete extensions of PA, in: H.-D. Ebbinghaus, G. H. Müller, and G. E. Sacks, eds., Recursion theory week 1984, Lect. Notes in Math. 1141 (1985) 245–259.
A. Kucera, On relative randomness, Annals of Pure and Applied Logic 63 (1993) 61–67.
A. Kucera and S. A. Terwijn, Lowness for the class of random sets, J. Symbolic Logic 64 (4) (1999) 1396–1402.
S. A. Kurtz, Randomness and genericity in the degrees of unsolvability, PhD Thesis, University of Illinois, 1981.
M. Li and P. Vitânyi, An introduction to Kolmogorov complexity and its applications, 2nd edition, Springer-Verlag, 1997.
J. H. Lutz, Category and measure in complexity classes, SIAM J. Comput. 19 (1990) 1100–1131.
J. H. Lutz, Almost everywhere high nonuniform complexity, J. Comput. System Sci. 44 (1992) 220–258.
P. Martin-Löf, The definition of random sequences, Information and Control 9 (1966) 602–619.
K. W. Regan, D. Sivakumar, and J.-Y. Cai, Pseudorandom Generators, Measure Theory, and Natural Proofs, 36th Annual Symp. on Foundations of Comp. Sci. (FOCS’95), 26–35, IEEE Computer Society Press, 1995.
G. E. Sacks, Degrees of unsolvability, Annals of Mathematics Studies 55, Princeton University Press, 1963.
C.-P. Schnorr, Zufälligkeit und Wahrscheinlichkeit, Lect. Notes in Math. 218, Springer-Verlag, 1971.
R. I. Soare, Recursively enumerable sets and degrees, Springer-Verlag, 1987.
S. A. Terwijn, Computability and Measure, PhD Thesis, ILLC/University of Amsterdam, 1998.
J. Ville, Étude critique de la notion de collectif, Gauthier-Villars, 1939.
Y. Wang, Randomness and complexity, PhD Thesis, Universität Heidelberg, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Terwijn, S.A. (2001). On the Quantitative Structure of Δ 02 . In: Schuster, P., Berger, U., Osswald, H. (eds) Reuniting the Antipodes — Constructive and Nonstandard Views of the Continuum. Synthese Library, vol 306. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9757-9_23
Download citation
DOI: https://doi.org/10.1007/978-94-015-9757-9_23
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5885-0
Online ISBN: 978-94-015-9757-9
eBook Packages: Springer Book Archive