scientific article; zbMATH DE number 3492569
From MaRDI portal
Publication:4074808
zbMATH Open0314.94019MaRDI QIDQ4074808FDOQ4074808
Authors: Peter Gács 
Publication date: 1974
Title of this publication is not available (Why is that?)
Cited In (47)
- Program size complexity for possibly infinite computations
- Conditional Kolmogorov complexity and universal probability
- An additivity theorem for plain Kolmogorov complexity
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice
- Computational depth and reducibility
- Milking the Aanderaa argument
- Algorithmic arguments in physics of computation
- Fixed point theorems on partial randomness
- The Normalized Algorithmic Information Distance Can Not Be Approximated
- 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
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
- Kolmogorov complexity arguments in combinatorics
- Martingales in the Study of Randomness
- Symmetry of information and one-way functions
- On generalized computable universal priors and their convergence
- 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 prediction and Bayesian confirmation
- Statistical properties of finite sequences with high Kolmogorov complexity
- On universal transfer learning
- Short lists with short programs in short time
- The discovery of algorithmic probability
- Algorithmic information theory and its statistical mechanical interpretation
- Chaitin's \(\Omega\) as a continuous function
- Kolmogorov complexity in perspective. I: Information theory and randomness
- An almost machine-independent theory of program-length complexity, sophistication, and induction
- Randomness and Effective Dimension of Continued Fractions.
- On continued fraction randomness and normality
- 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
- Relations between varieties of kolmogorov complexities
- Random Continuous Functions
- Entropy measures vs. Kolmogorov complexity
- 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)
