Algorithms and Randomness

Cited in

(37)

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

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)