Algorithms and Randomness

From MaRDI portal
Publication:3793412

DOI10.1137/1132060zbMath0648.60005OpenAlexW2001132147MaRDI QIDQ3793412

Vladimir A. Uspensky

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




Related Items (27)

Which properties of a random sequence are dynamically sensitive?Computational depth and reducibilityHartmanis-Stearns Conjecture on Real Time and TranscendenceComputational depth and reducibilityAn approximate entropy test for randomnessThe evolution of human communication and the information revolution --- A mathematical perspectiveStatistical properties of discretizations of a class of chaotic dynamical systemsThe Kolmogorov birthday paradoxKolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)Feasible reductions to Kolmogorov-Loveland stochastic sequencesRandom languages for nonuniform complexity classesRevisiting Chaitin's incompleteness theoremAlmost everywhere high nonuniform complexityThe Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequencesSemibinomial conditionally nonlinear autoregressive models of discrete random sequences: probabilistic properties and statistical parameter estimationOn relative randomnessA Characterization of Constructive DimensionCircuit size relative to pseudorandom oraclesPrequential randomness and probabilityOn a definition of random sequences with respect to conditional probabilityVladimir Andreevich Uspensky (27/11/1930–27/6/2018)Mathematical metaphysics of randomnessErgodic theorems for individual random sequencesNon-stochastic infinite and finite sequencesLarge data series: modeling the usual to identify the unusual.Basin of attraction of cycles of discretizations of dynamical systems with SRB invariant measures.An upward measure separation theorem




This page was built for publication: Algorithms and Randomness