Mathematical metaphysics of randomness

DOI10.1016/S0304-3975(98)00069-3zbMath0922.60014MaRDI QIDQ1275005

A. L. Semenov, Vladimir A. Uspensky, Andrej A. Muchnik

Publication date: 12 January 1999

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

zbMATH Keywords

random sequencesstochastic sequencechaotic sequencelawless sequenceunpredictable sequence

Mathematics Subject Classification ID

Foundations of probability theory (60A99)

Related Items

When does randomness come from randomness?, Randomness, Computation and Mathematics, Comparing notions of randomness, Probabilistic Algorithmic Randomness, Kolmogorov-Loveland stochasticity for finite strings, Randomness? What randomness?, Randomization in Automata on Infinite Trees, Continuous randomness via transformations of 2-random sequences, Do stronger definitions of randomness exist?, Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests, Algorithmic randomness and monotone complexity on product space, Algorithmic Statistics: Forty Years Later, Some Questions in Computable Mathematics, How much randomness is needed for statistics?, Implications of contrarian and one-sided strategies for the fair-coin game, The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences, The complexity of stochastic sequences, Strong reductions in effective randomness, How powerful are integer-valued martingales?, Effective Randomness for Computable Probability Measures, Kolmogorov-Loveland stochasticity and Kolmogorov complexity, Algorithmic Statistics Revisited, Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds, A universal pair of 1/2-betting strategies, Vladimir Andreevich Uspensky (27/11/1930–27/6/2018), Non-stochastic infinite and finite sequences, Computable randomness and betting for computable probability spaces, Randomness is inherently imprecise, Constructive equivalence relations on computable probability measures, Randomness and Computability: Open Questions, Calibrating Randomness, Measures and their random reals, Lowness properties and randomness, Kolmogorov-Loveland randomness and stochasticity, Simple betting and stochasticity

Cites Work

• Nonstochastic estimates
• Process complexity and effective random tests
• On equivalence of infinite product measures
• Can an individual sequence of zeros and ones be random?
• Every sequence is reducible to a random one
• Algorithms and Randomness
• Exact Expressions for Some Randomness Tests
• Relations between varieties of kolmogorov complexities
• Logical basis for information theory and probability theory
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item