Algorithms and Randomness

DOI10.1137/1132060MaRDI QIDQ3793412zbMATH OpenOpenAlexFDO

Authors V. A. Uspenskiĭ, A. N. Kolmogorov

Publication date 1987

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5941100d21d13c32ba1ddb4491194f187993b266

zbMATH Keywords

algorithmic definition of randomnesscomplexityentropygeneration of random numbers

Mathematics Subject Classification ID

Foundations of probability theory (60A99)

Cited in

(37)

• Random languages for nonuniform complexity classes
• Almost everywhere high nonuniform complexity
• Circuit size relative to pseudorandom oracles
• Mathematical metaphysics of randomness
• Ergodic theorems for individual random sequences
• Non-stochastic infinite and finite sequences
• Computational depth and reducibility
• Large data series: modeling the usual to identify the unusual.
• Basin of attraction of cycles of discretizations of dynamical systems with SRB invariant measures.
• Which properties of a random sequence are dynamically sensitive?
• Statistical properties of discretizations of a class of chaotic dynamical systems
• Feasible reductions to Kolmogorov-Loveland stochastic sequences
• Revisiting Chaitin's incompleteness theorem
• Semibinomial conditionally nonlinear autoregressive models of discrete random sequences: probabilistic properties and statistical parameter estimation
• Hartmanis-Stearns Conjecture on Real Time and Transcendence
• Randomized algorithms and pseudorandom numbers
• Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence
• An approximate entropy test for randomness
• Computational depth and reducibility
• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
• scientific article; zbMATH DE number 4113619 (Why is no real title available?)
• A Characterization of Constructive Dimension
• Algorithmic Randomness
• Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
• Probabilistic Algorithmic Randomness
• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 5264766 (Why is no real title available?)
• scientific article; zbMATH DE number 5057386 (Why is no real title available?)
• The evolution of human communication and the information revolution --- A mathematical perspective
• The Kolmogorov birthday paradox
• Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)
• Assumptions of randomness in cosmology models
• On relative randomness
• Testing exchangeability in the batch mode with e-values and Markov alternatives
• An upward measure separation theorem
• Prequential randomness and probability
• On a definition of random sequences with respect to conditional probability

This page was built for publication: Algorithms and Randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3793412)