Complexity-based induction systems: Comparisons and convergence theorems
From MaRDI portal
Publication:4160129
DOI10.1109/TIT.1978.1055913zbMath0382.60003MaRDI QIDQ4160129
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (55)
A Note on Blum Static Complexity Measures ⋮ A test for randomness based on a complexity measure ⋮ Simultaneous predictive Gaussian classifiers ⋮ Tractability of batch to sequential conversion ⋮ On semimeasures predicting Martin-Löf random sequences ⋮ Autonomous theory building systems ⋮ On universal prediction and Bayesian confirmation ⋮ The representation and manipulation of the algorithmic probability measure for problem solving. ⋮ `Ideal learning' of natural language: positive results about learning from positive evidence ⋮ An almost machine-independent theory of program-length complexity, sophistication, and induction ⋮ Unnamed Item ⋮ On generalized computable universal priors and their convergence ⋮ Algorithmic complexity bounds on future prediction errors ⋮ The discovery of algorithmic probability ⋮ Open problems in universal induction \& intelligence ⋮ Obituary: Ray Solomonoff, founding father of algorithmic information theory ⋮ Universal knowledge-seeking agents ⋮ A philosophical treatise of universal induction ⋮ Martingales in the Study of Randomness ⋮ Predicting non-stationary processes ⋮ The generalized universal law of generalization. ⋮ A classical way forward for the regularity and normalization problems ⋮ Merging of opinions in game-theoretic probability ⋮ On the computability of Solomonoff induction and AIXI ⋮ On Universal Transfer Learning ⋮ Absolutely no free lunches! ⋮ Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor ⋮ Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments ⋮ Universal forecasting algorithms ⋮ Inductive reasoning and Kolmogorov complexity ⋮ Consistency of discrete Bayesian learning ⋮ Leading strategies in competitive on-line prediction ⋮ Macrodynamic Cooperative Complexity of Information Dynamics ⋮ THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS ⋮ HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT ⋮ The probability of ``undefined (non-converging) output in generating the universal probability distribution ⋮ On Martin-Löf Convergence of Solomonoff’s Mixture ⋮ Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics ⋮ Explanatory and creative alternatives to the MDL principle ⋮ Probability theory for the Brier game ⋮ New error bounds for Solomonoff prediction ⋮ Philosophical issues in Kolmogorov complexity ⋮ Putnam's diagonal argument and the impossibility of a universal learning machine ⋮ On calibration error of randomized forecasting algorithms ⋮ On universal transfer learning ⋮ A theory of incremental compression ⋮ Things Bayes Can’t Do ⋮ Solomonoff Induction Violates Nicod’s Criterion ⋮ On the Computability of Solomonoff Induction and Knowledge-Seeking ⋮ Uniform test of algorithmic randomness over a general space ⋮ Applying MDL to learn best model granularity ⋮ Sequential predictions based on algorithmic complexity ⋮ Thinking with notations: epistemic actions and epistemic activities in mathematical practice ⋮ On Martin-Löf (non-)convergence of Solomonoff's universal mixture ⋮ Predictions and algorithmic statistics for infinite sequences
This page was built for publication: Complexity-based induction systems: Comparisons and convergence theorems
