Randomness, computation and mathematics
From MaRDI portal
Recommendations
Cites work
- A characterization of the entropies of multidimensional shifts of finite type
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- A Theory of Program Size Formally Identical to Information Theory
- A unified approach to the definition of random sequences
- Algorithmic randomness and complexity.
- Calibrating Randomness
- Computability and randomness
- Computability of Julia sets
- Dynamics of a generic Brownian motion: Recursive aspects
- Effective dimension of points visited by Brownian motion
- Effective randomness for continuous measures
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Effectively closed sets of measures and randomness
- Ergodic-Type Characterizations of Algorithmic Randomness
- Every sequence is reducible to a random one
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- Five lectures on algorithmic randomness
- From index sets to randomness in ∅n: random reals and possibly infinite computations part II
- scientific article; zbMATH DE number 5851986 (Why is no real title available?)
- scientific article; zbMATH DE number 6019540 (Why is no real title available?)
- scientific article; zbMATH DE number 4008384 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 3508473 (Why is no real title available?)
- scientific article; zbMATH DE number 3635380 (Why is no real title available?)
- scientific article; zbMATH DE number 5057386 (Why is no real title available?)
- scientific article; zbMATH DE number 5064956 (Why is no real title available?)
- scientific article; zbMATH DE number 3026521 (Why is no real title available?)
- scientific article; zbMATH DE number 3034029 (Why is no real title available?)
- Increasing the gap between descriptional complexity and algorithmic probability
- Information Distance in Multiples
- Interactions of computability and randomness
- Kolmogorov complexity and solovay functions
- Kolmogorov complexity and strong approximation of Brownian motion
- Kolmogorov Complexity with Error
- Kolmogorov entropy in the context of computability theory
- Limit complexities revisited
- Limits on the Computational Power of Random Strings
- Lowness properties and randomness
- Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
- Mass problems associated with effectively closed sets
- Mathematical metaphysics of randomness
- Non-computable Julia sets
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On the complexity of random strings
- On the relation between descriptional complexity and algorithmic probability
- Power from Random Strings
- Randomness and Computability: Open Questions
- Randomness and differentiability
- Randomness and recursive enumerability
- Randomness on computable probability spaces -- a dynamical point of view
- Randomness, relativization and Turing degrees
- Reconciling Data Compression and Kolmogorov Complexity
- Strong jump-traceability. I: The computably enumerable case
- Symbolic dynamics: entropy = dimension = complexity
- The definition of random sequences
- The descriptive complexity of Brownian motion
- The importance of \(\Pi^0_1\) classes in effective randomness
- The metamathematics of ergodic theory
- Time-Bounded Kolmogorov Complexity and Solovay Functions
- Turing's normal numbers: towards randomness
- What can be efficiently reduced to the Kolmogorov-random strings?
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
Cited in
(23)- Mathematical metaphysics of randomness
- Monotonous betting strategies in warped casinos
- Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács
- scientific article; zbMATH DE number 1688364 (Why is no real title available?)
- Random simulations for generative art construction -- some examples
- A level of Martin-Lof randomness.
- Randomness and computation
- An introduction to (algorithmic) randomness
- Some bridging results and challenges in classical, quantum and computational randomness
- Computability, algorithmic randomness and complexity
- Randomness and Computability: Open Questions
- The Power and Weakness of Randomness in Computation
- Computability and randomness
- Randomness conservation inequalities; information and independence in mathematical theories
- Algorithmic Complexity and Randomness: Recent Developments
- scientific article; zbMATH DE number 1195809 (Why is no real title available?)
- scientific article; zbMATH DE number 1163978 (Why is no real title available?)
- scientific article; zbMATH DE number 1487695 (Why is no real title available?)
- scientific article; zbMATH DE number 1790493 (Why is no real title available?)
- Non-Algorithmic Theory of Randomness
- Randomness, pseudorandomness and models of arithmetic
- Computability and information in models of randomness and chaos
- A comparative study of the smallest probability intervals for which a binary sequence is random
This page was built for publication: Randomness, computation and mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904405)
