Mathematical metaphysics of randomness
From MaRDI portal
Publication:1275005
DOI10.1016/S0304-3975(98)00069-3zbMATH Open0922.60014MaRDI QIDQ1275005FDOQ1275005
Authors: A. L. Semenov, V. A. Uspenskiĭ, Andrej Muchnik 
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Publication:4729770
- Randomness notions and reverse mathematics
- The axiomatization of randomness
- RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS
- A THEORY OF RANDOMNESS
- scientific article; zbMATH DE number 739156
- Randomness, computation and mathematics
- Determinism, indeterminism and mathematics
- Inevitable randomness in discrete mathematics
- Chaos and randomness. Philosophical aspects of mathematical concepts of randomness in chaotic systems
Cites Work
- Process complexity and effective random tests
- 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
- Exact Expressions for Some Randomness Tests
- Title not available (Why is that?)
- Logical basis for information theory and probability theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Every sequence is reducible to a random one
- On equivalence of infinite product measures
- Title not available (Why is that?)
- Relations between varieties of kolmogorov complexities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms and Randomness
- Can an individual sequence of zeros and ones be random?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonstochastic estimates
- Title not available (Why is that?)
Cited In (35)
- COINCIDENCES ARE NOT ACCIDENTAL: A THEOREM
- Do stronger definitions of randomness exist?
- Some Questions in Computable Mathematics
- Kolmogorov-Loveland stochasticity and Kolmogorov complexity
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests
- Comparing notions of randomness
- Constructive equivalence relations on computable probability measures
- Algorithmic statistics revisited
- Continuous randomness via transformations of 2-random sequences
- When does randomness come from randomness?
- Title not available (Why is that?)
- Implications of contrarian and one-sided strategies for the fair-coin game
- Randomness, computation and mathematics
- Simple betting and stochasticity
- Calibrating Randomness
- Randomness and Computability: Open Questions
- Strong reductions in effective randomness
- Randomization in automata on infinite trees
- Kolmogorov-Loveland stochasticity for finite strings
- The complexity of stochastic sequences
- A universal pair of 1/2-betting strategies
- Lowness properties and randomness
- Kolmogorov-Loveland randomness and stochasticity
- Non-stochastic infinite and finite sequences
- Randomness is inherently imprecise
- Algorithmic statistics: forty years later
- Measures and their random reals
- Computable randomness and betting for computable probability spaces
- Randomness? What randomness?
- Effective randomness for computable probability measures
- Exact learning algorithms, betting games, and circuit lower bounds
- Probabilistic Algorithmic Randomness
- Algorithmic randomness and monotone complexity on product space
- Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
This page was built for publication: Mathematical metaphysics of randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275005)
