scientific article; zbMATH DE number 3489016

Cited in

(80)

Scaled dimension and the Kolmogorov complexity of Turing-hard sets
On the relation between descriptional complexity and algorithmic probability
Random sequence generation by cellular automata
On the notion of infinite pseudorandom sequences
An improved zero-one law for algorithmically random sequences
On independent random oracles
Inductive reasoning and Kolmogorov complexity
On the inference of optimal descriptions
Mathematical metaphysics of randomness
Ergodic theorems for individual random sequences
Computational depth and reducibility
On collapsing the polynomial-time hierarchy
The discovery of algorithmic probability
Algorithmic complexity of recursive and inductive algorithms
Dimension 1 sequences are close to randoms
A generalized characterization of algorithmic probability
An algorithmic look at financial volatility
Epistemic horizons and the foundations of quantum mechanics
Equidistribution, uniform distribution: a probabilist's perspective
Recursive computational depth.
Randomness and reducibility
Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
On Kurtz randomness
The dimensions of individual strings and sequences
The Kolmogorov complexity of random reals
Feasible reductions to Kolmogorov-Loveland stochastic sequences
Randomness deficiencies
Randomness is inherently imprecise
Thinking with notations: epistemic actions and epistemic activities in mathematical practice
On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
On the computational power of random strings
On semimeasures predicting Martin-Löf random sequences
On effectively closed sets of effective strong measure zero
Random reals à la Chaitin with or without prefix-freeness
Uniform test of algorithmic randomness over a general space
Sequential predictions based on algorithmic complexity
An almost machine-independent theory of program-length complexity, sophistication, and induction
The Kučera-Gács theorem revisited by Levin
Mutual dimension
The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite
Multiple usage of random bits in finite automata
Randomness and the ergodic decomposition
Sub-computable bounded pseudorandomness
Prequential Randomness
scientific article; zbMATH DE number 3605746 (Why is no real title available?)
scientific article; zbMATH DE number 558650 (Why is no real title available?)
Computational depth and reducibility
Relations between varieties of kolmogorov complexities
On oscillation-free -random sequences
Random Continuous Functions
Random sequences with respect to a measure defined by two linear fractional transformations
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
Algorithmic Fractal Dimensions in Geometric Measure Theory
Dimension spectra of lines
Kolmogorov complexity in perspective. I: Information theory and randomness
Algorithmic randomness over general spaces
Program size complexity for possibly infinite computations
A natural encoding scheme proved probabilistic polynomial complete
Recursively enumerable reals and Chaitin \(\Omega\) numbers
Extending the reach of the point-to-set principle
A circuit complexity formulation of algorithmic information theory
Martingales in the Study of Randomness
Andrei Kolmogorov and Leonid Levin on Randomness
A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS
Algorithmic randomness and monotone complexity on product space
Imprecision in martingale- and test-theoretic prequential randomness
A comparative study of the smallest probability intervals for which a binary sequence is random
Randomness and invariance
Algorithmically optimal outer measures
Kolmogorov complexity in the USSR (1975--1982): isolation and its end
On empirical meaning of randomness with respect to parametric families of probability distributions
Randomness and imprecision: from supermartingales to randomness tests
Effective continued fraction dimension versus effective Hausdorff dimension of reals
Process and truth-table characterisations of randomness
Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets
On generalized computable universal priors and their convergence
Algorithmic randomness of continuous functions
Leading strategies in competitive on-line prediction
Prequential randomness and probability
On a definition of random sequences with respect to conditional probability

This page was built for publication:

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