scientific article; zbMATH DE number 3492569

Cited in

(49)

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

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)