Abstract
Let Γ be a set of functions on the natural numbers. We introduce a new randomness notion called semi Γ-randomness, which is associated with a Γ-indexed test. Fix a computable sequence {G n } n ∈ ω of all c.e. open sets. For any f ∈ Γ, {G f(n)} n ∈ ω is called a Γ-indexed test if μ(G f(n)) ≤ 2− n for all n. We prove that weak n-randomness is strictly stronger than semi \(\Delta^0_n\)-randomness, for n > 2. Moreover, we investigate the relationships between various definitions of randomness.
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
Demuth, O.: Some classes of arithmetical real numbers. Commentations Mathematicae Universitatis Carolinae 23(3), 453–465 (1982) (Russian)
Demuth, O.: Remarks on the structure of tt-degrees based on constructive measure theory. Commentations Mathematicae Universitatis Carolinae 29(2), 233–247 (1988)
Downey, R.G., Hirshfeldt, D.R.: Hirshfeldt: Algorithmic Randomness and Complexity. Springer, Berlin (2010)
Kurtz, S.A.: Randomness and genericity in the degrees of unsolvability. Ph.D. Dissertation, University of Illinois, Urbana (1981)
Kučera, A., Nies, A.: Demuth randomness and computational complexity. Annals of Pure and Applied Logic 162(7), 504–513 (2011)
Martin-Löf, P.: The definition of random sequences. Information and Control 9(6), 602–619 (1966)
Miller, J.S., Yu, L.: On initial segment complexity and degrees of randomness. Transactions of the American Mathematical Society 360(6), 3193–3210 (2008)
Nies, A.: Computability and Randomness. Oxford University Press (2009)
Peng, N.N.: Algorithmic randomness and lowness notions. Master Thesis, Mathematical Institute, Tohoku University, Sendai, Japan (2010)
Peng, N.N.: The notions between Martin Löf randomness and 2-randomness. RIMS Kôkyûroku (1792), 117–122 (2010)
Yu, L.: Characterizing strong randomness via Martin-Löf randomness. Annals of Pure and Applied Logic 163(3), 214–224 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, N., Higuchi, K., Yamazaki, T., Tanaka, K. (2012). Relative Randomness for Martin-Löf Random Sets. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_58
Download citation
DOI: https://doi.org/10.1007/978-3-642-30870-3_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30869-7
Online ISBN: 978-3-642-30870-3
eBook Packages: Computer ScienceComputer Science (R0)