Skip to main content Accessibility help
×
Home

Every 2-random real is Kolmogorov random

Published online by Cambridge University Press:  12 March 2014


Joseph S. Miller
Affiliation:
School of Mathematical and Computing Sciences, Victoria University, P.O. Box 600 Wellington, New Zealand, E-mail: Joe.Miller@mcs.vuw.ac.nz
Corresponding
E-mail address:

Abstract.

We study reals with infinitely many incompressible prefixes. Call A ∈ 2ωKolmogorov random if . where C denotes plain Kolmogorov complexity. This property was suggested by Loveland and studied by Martin-Löf. Schnorr and Solovay. We prove that 2-random reals are Kolmogorov random. Together with the converse—proved by Nies. Stephan and Terwijn [11]—this provides a natural characterization of 2-randomness in terms of plain complexity. We finish with a related characterization of 2-randomness.


Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2004

Access options

Get access to the full version of this content by using one of the access options below.

References

[1]Chaitin, Gregory J., A theory of program size formally identical to information theory, Journal of the Association for Computing Machinery, vol. 22 (1975), pp. 329340.CrossRefGoogle Scholar
[2]Daley, Robert P., Complexity and randomness, Computational complexity (Courant Computer Science Symposium 7, New York University, New York, 1971), Algorithmics Press, New York, 1973, pp. 113122.Google Scholar
[3]Downey, R. and Hirschfeldt, D., Algorithmic randomness and complexity, Springer-Verlag, Berlin, to appear.CrossRefGoogle Scholar
[4]Kolmogorov, A. N., Three approaches to the definition of the concept “quantity of information”, Problemy Peredači Informacii, vol. 1 (1965), no. vyp. 1, pp. 311.Google Scholar
[5]Levin, L. A., The concept of a random sequence, Doklady Akademii Nauk SSSR, vol. 212 (1973), pp. 548550.Google Scholar
[6]Li, M. and Vitányi, P., An introduction to Kolmogorov complexity and its applications, Texts and Monographs in Computer Science, Springer-Verlag, New York, 1993.CrossRefGoogle Scholar
[7]Loveland, Donald W., On minimal-program complexity measures, ACM Symposium on the Theory of Computing (STOC), ACM Press, New York, 05 1969, pp. 6178.Google Scholar
[8]Martin-Löf, Per, The definition of random sequences, Information and Control, vol. 9 (1966), pp. 602619.CrossRefGoogle Scholar
[9]Martin-Löf, Per, Complexity oscillations in infinite binary sequences, Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol. 19 (1971), pp. 225230.CrossRefGoogle Scholar
[10]Miller, Joseph S. and Yu, Liang, On initial segment complexity and degrees of randomness, in preparation.Google Scholar
[11]Nies, André, Stephan, Frank, and Terwijn, Sebastiaan A., Randomness, relativization and Turing degrees, submitted to this Journal.Google Scholar
[12]Schnorr, C. P., A unified approach to the definition of random sequences, Mathematical Systems Theory, vol. 5 (1971), pp. 246258.CrossRefGoogle Scholar
[13]Solomonoff, R. J., A formal theory of inductive inference I and II, Information and Control, vol. 7 (1964). pp. 1–22, 224254.CrossRefGoogle Scholar
[14]Solovay, Robert M., Draft of paper (or series of papers) on Chaitin's work, unpublished notes. 215 pages, 05 1975.Google Scholar
[15]Yu, Liang, Decheng, Ding, and Downey, Rod G., The Kolmogorov complexity of the random reals, submitted.Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 8 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 5th December 2020. This data will be updated every 24 hours.

Hostname: page-component-b4dcdd7-ppfm2 Total loading time: 0.284 Render date: 2020-12-05T02:28:56.681Z Query parameters: { "hasAccess": "0", "openAccess": "0", "isLogged": "0", "lang": "en" } Feature Flags last update: Sat Dec 05 2020 02:00:00 GMT+0000 (Coordinated Universal Time) Feature Flags: { "metrics": true, "metricsAbstractViews": false, "peerReview": true, "crossMark": true, "comments": true, "relatedCommentaries": true, "subject": true, "clr": false, "languageSwitch": true }

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Every 2-random real is Kolmogorov random
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Every 2-random real is Kolmogorov random
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Every 2-random real is Kolmogorov random
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *