scientific article
From MaRDI portal
zbMath0314.94019MaRDI QIDQ4074808
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Kolmogorov complexity arguments in combinatorics, Randomness and reducibility, Computational depth and reducibility, A Note on Blum Static Complexity Measures, The Normalized Algorithmic Information Distance Can Not Be Approximated, 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, Computational depth and reducibility, Characterising the Martin-Löf random sequences using computably enumerable sets of measure one, Algorithmic arguments in physics of computation, On universal prediction and Bayesian confirmation, An almost machine-independent theory of program-length complexity, sophistication, and induction, On generalized computable universal priors and their convergence, Dimension spectra of lines1, The discovery of algorithmic probability, Statistical properties of finite sequences with high Kolmogorov complexity, Conditional Kolmogorov complexity and universal probability, On continued fraction randomness and normality, Fixed point theorems on partial randomness, Martingales in the Study of Randomness, CHAITIN’S Ω AS A CONTINUOUS FUNCTION, A generalized characterization of algorithmic probability, Randomness as an invariant for number representations, Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács, An additivity theorem for plain Kolmogorov complexity, Milking the Aanderaa argument, Relations between varieties of kolmogorov complexities, Bounding the dimension of points on a line, Proofs of conservation inequalities for Levin's notion of mutual information of 1974, Algorithmic randomness of continuous functions, Entropy measures vs. Kolmogorov complexity, Algorithmic information theory and its statistical mechanical interpretation, Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs, Inductive reasoning and Kolmogorov complexity, Short lists with short programs in short time, Average case complexity under the universal distribution equals worst- case complexity, Random Continuous Functions, Program size complexity for possibly infinite computations, Symmetry of information and one-way functions, On universal transfer learning, Randomness and Effective Dimension of Continued Fractions., Computable Bayesian Compression for Uniformly Discretizable Statistical Models, Uniform test of algorithmic randomness over a general space, Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness, On the relation between descriptional complexity and algorithmic probability, Entropic measures, Markov information sources and complexity, Sequential predictions based on algorithmic complexity, Thinking with notations: epistemic actions and epistemic activities in mathematical practice
