Non-stochastic infinite and finite sequences

DOI10.1016/S0304-3975(98)00073-5zbMath0915.68079MaRDI QIDQ1275010

Vladimir V. V'yugin

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

algorithmic information theoryforecasting systemscomputable calibrationmeasure of nonrandomnessnon-stochastic sequences

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items

On Sequences with Non-learnable Subsequences, On Calibration Error of Randomized Forecasting Algorithms, HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT, On calibration error of randomized forecasting algorithms, On universal algorithms for adaptive forecasting, Most sequences are stochastic

Cites Work

• Kolmogorov's contributions to information theory and algorithmic complexity
• Nonstochastic estimates
• Calibration-based empirical probability
• Mathematical metaphysics of randomness
• Ergodic theorems for individual random sequences
• Bayesianism: An algorithmic analysis
• Can an individual sequence of zeros and ones be random?
• Self-Calibrating Priors Do Not Exist
• Randomness conservation inequalities; information and independence in mathematical theories
• Algorithms and Randomness
• The Well-Calibrated Bayesian
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The definition of random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item