On semimeasures predicting Martin-Löf random sequences
Authors:
- 1 September 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 382 (3) , 247-261
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Convergence and loss bounds for bayesian sequence predictionIEEE Transactions on Information Theory, 2003
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMITInternational Journal of Foundations of Computer Science, 2002
- Kolmogorov entropy in the context of computability theoryTheoretical Computer Science, 2002
- Minimum description length induction, Bayesianism, and Kolmogorov complexityIEEE Transactions on Information Theory, 2000
- Complexity-based induction systems: Comparisons and convergence theoremsIEEE Transactions on Information Theory, 1978
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMSRussian Mathematical Surveys, 1970
- The definition of random sequencesInformation and Control, 1966
- A formal theory of inductive inference. Part IInformation and Control, 1964