Archive for Mathematical Logic 54 (5-6):615-629 (2015)
| Abstract | This article has no associated abstract. (fix it) |
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| ISBN(s) | |
| DOI | 10.1007/s00153-015-0430-2 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 70,265
External links
- From the Publisher via CrossRef (no proxy)
- arxiv.org
(no proxy) - arxiv.org [2] (no proxy)
- link.springer.com (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
Randomness, Relativization and Turing Degrees.André Nies, Frank Stephan & Sebastiaan A. Terwijn - 2005 - Journal of Symbolic Logic 70 (2):515-535.
The K -Degrees, Low for K Degrees,and Weakly Low for K Sets.Joseph S. Miller - 2009 - Notre Dame Journal of Formal Logic 50 (4):381-391.
Every 2-Random Real is Kolmogorov Random.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (3):907-913.
Exact Expressions for Some Randomness Tests.Peter Gács - 1980 - Mathematical Logic Quarterly 26 (25-27):385-394.
Citations of this work BETA
Randomness Notions and Reverse Mathematics.André Nies & Paul Shafer - 2020 - Journal of Symbolic Logic 85 (1):271-299.
Similar books and articles
Complexity of Complexity and Strings with Maximal Plain and Prefix Kolmogorov Complexity.B. Bauwens & A. Shen - 2014 - Journal of Symbolic Logic 79 (2):620-632.
The K -Degrees, Low for K Degrees,and Weakly Low for K Sets.Joseph S. Miller - 2009 - Notre Dame Journal of Formal Logic 50 (4):381-391.
Every 2-Random Real is Kolmogorov Random.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (3):907-913.
Program Size Complexity for Possibly Infinite Computations.Verónica Becher, Santiago Figueira, André Nies & Silvana Picchi - 2005 - Notre Dame Journal of Formal Logic 46 (1):51-64.
The Kolmogorov Complexity of Random Reals.Liang Yu, Decheng Ding & Rodney Downey - 2004 - Annals of Pure and Applied Logic 129 (1-3):163-180.
Kolmogorov Complexity for Possibly Infinite Computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
On Partial Randomness.Cristian S. Calude, Ludwig Staiger & Sebastiaan A. Terwijn - 2006 - Annals of Pure and Applied Logic 138 (1):20-30.
Elementary Differences Between the Degrees of Unsolvability and Degrees of Compressibility.George Barmpalias - 2010 - Annals of Pure and Applied Logic 161 (7):923-934.
Kolmogorov–Loveland Randomness and Stochasticity.Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann & Frank Stephan - 2006 - Annals of Pure and Applied Logic 138 (1):183-210.
Probability and Randomness.Antony Eagle - 2016 - In Alan Hájek & Christopher Hitchcock (eds.), The Oxford Handbook of Probability and Philosophy. Oxford, U.K.: Oxford University Press. pp. 440-459.
Kolmogorov Complexity and Information Theory. With an Interpretation in Terms of Questions and Answers.Peter D. Grünwald & Paul M. B. Vitányi - 2003 - Journal of Logic, Language and Information 12 (4):497-529.
Kolmogorov Complexity and Set Theoretical Representations of Integers.Marie Ferbus-Zanda & Serge Grigorieff - 2006 - Mathematical Logic Quarterly 52 (4):375-403.
Enumerations of the Kolmogorov Function.Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan & Leen Torenvliet - 2006 - Journal of Symbolic Logic 71 (2):501 - 528.
Analytics
Added to PP index
2015-09-03
Total views
16 ( #665,931 of 2,507,715 )
Recent downloads (6 months)
1 ( #416,820 of 2,507,715 )
2015-09-03
Total views
16 ( #665,931 of 2,507,715 )
Recent downloads (6 months)
1 ( #416,820 of 2,507,715 )
How can I increase my downloads?
Downloads
