scientific article; zbMATH DE number 3492569

Cited in

(47)

Conditional Kolmogorov complexity and universal probability
Program size complexity for possibly infinite computations
An additivity theorem for plain Kolmogorov complexity
Thinking with notations: epistemic actions and epistemic activities in mathematical practice
Milking the Aanderaa argument
Fixed point theorems on partial randomness
Computational depth and reducibility
Algorithmic arguments in physics of computation
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
Relating and contrasting plain and prefix Kolmogorov complexity
The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite
Average case complexity under the universal distribution equals worst- case complexity
The Normalized Algorithmic Information Distance Can Not Be Approximated
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
Kolmogorov complexity arguments in combinatorics
On generalized computable universal priors and their convergence
Martingales in the Study of Randomness
Symmetry of information and one-way functions
Randomness and reducibility
Dimension spectra of lines
Randomness as an invariant for number representations
On the relation between descriptional complexity and algorithmic probability
Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács
A note on Blum static complexity measures
On universal transfer learning
On universal prediction and Bayesian confirmation
The discovery of algorithmic probability
Short lists with short programs in short time
Statistical properties of finite sequences with high Kolmogorov complexity
Algorithmic information theory and its statistical mechanical interpretation
Chaitin's \(\Omega\) as a continuous function
An almost machine-independent theory of program-length complexity, sophistication, and induction
Kolmogorov complexity in perspective. I: Information theory and randomness
On continued fraction randomness and normality
Randomness and Effective Dimension of Continued Fractions.
Computational depth and reducibility
Uniform test of algorithmic randomness over a general space
Sequential predictions based on algorithmic complexity
Inductive reasoning and Kolmogorov complexity
Proofs of conservation inequalities for Levin's notion of mutual information of 1974
Computable Bayesian compression for uniformly discretizable statistical models
Algorithmic randomness of continuous functions
Entropy measures vs. Kolmogorov complexity
Relations between varieties of kolmogorov complexities
Random Continuous Functions
Entropic measures, Markov information sources and complexity
A generalized characterization of algorithmic 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 Q4074808)