A formal theory of inductive inference. Part I

DOI10.1016/S0019-9958(64)90223-2zbMath0258.68045WikidataQ54266495 ScholiaQ54266495MaRDI QIDQ5674429

Publication date: 1964

Published in: Information and Control (Search for Journal in Brave)

Related Items

A test for randomness based on a complexity measure, Algorithmic complexity of points in dynamical systems, Characterization of language learning front informant under various monotonicity constraints, Ignoring data may be the only way to learn efficiently, Quantitative limits on the ability of a Maxwell demon to extract work from heat, Unnamed Item, Competitive On-line Statistics, HOW DIFFICULT IS IT TO INVENT A NONTRIVIAL GAME?, Relations between varieties of kolmogorov complexities, Schnorr randomness, A unified approach to the definition of random sequences, A new method for sparsity control in support vector classification and regression, Recursively enumerable reals and Chaitin \(\Omega\) numbers, Stochastic complexity and the mdl principle, New error bounds for Solomonoff prediction, Descriptive complexity of computable sequences, Algorithmic information and simplicity in statistical physics, On the syntactic structure of protein sequences and the concept of grammar complexity, Algorithmic complexity bounds on future prediction errors, Entropy and algorithmic complexity in quantum information theory, Minimum message length encoding and the comparison of macromolecules, Learning recursive functions: A survey, Absolute versus probabilistic classification in a logical setting, On the relation between descriptional complexity and algorithmic probability, Towards a new theory of confirmation, Chaos dynamics executes inductive inference, Tape versus queue and stacks: The lower bounds, Towards a theory of chance - Part II, Complexity of algorithms and computations, An information-theoretic approach to time bounds for on-line computation, Theory construction in psychology: The interpretation and integration of psychological data, Universal forecasting algorithms, On the inference of optimal descriptions, Model discrimination using an algorithmic information criterion, Is The theory of everything merely the ultimate ensemble theory?, On the problem of stable image restoration, The representation and manipulation of the algorithmic probability measure for problem solving., The discovery of algorithmic probability, Stochastic complexity in learning, A catalog of Boolean concepts., The generalized universal law of generalization., Information theory: A multifaceted model of information, Applying MDL to learn best model granularity, A comparison of two approaches to pseudorandomness, Complexity analysis to explore the structure of ancient stromatolites, Randomness and reducibility, Generation of symmetric exponential sums, The dimensions of individual strings and sequences, Model selection based on minimum description length, \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration, Process complexity and effective random tests, On semimeasures predicting Martin-Löf random sequences, The Kolmogorov complexity of infinite words, Predicting non-stationary processes, Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem, Some non-conventional ideas about algorithmic complexity, Evolutionary induction of stochastic context free grammars, Certain aspects of graphic regularity, On the application of algorithmic information theory to decision problems, 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, Predictability, Complexity, and Learning, THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS, HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT, Estimating Entropy Rates with Bayesian Confidence Intervals, Statistical learning theory, model identification and system information content, Relations between information criteria for model-structure selection Part 2. Modelling by shortest data description, PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity, PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part II: Static Complexity, On initial segment complexity and degrees of randomness, Generalized kolmogorov complexity and other dual complexity measures, Kolmogorov and mathematical logic, Optimal enumerations and optimal gödel numberings, SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY