Minimum Message Length and Kolmogorov Complexity

DOI10.1093/comjnl/42.4.270zbMath0946.68062OpenAlexW1997404989MaRDI QIDQ4933946

David L. Dowe, Chris Wallace

Publication date: 17 October 2000

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4ef08582dc5c11b3286b463307dd6ee739d2f8c6

zbMATH Keywords

algorithmic complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (17)

Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable ⋮ Semiparametric Fractional Imputation Using Gaussian Mixture Models for Handling Multivariate Missing Data ⋮ Dynamic modeling of internet traffic for intrusion detection ⋮ Suboptimal behavior of Bayes and MDL in classification under misspecification ⋮ Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection ⋮ Universality probability of a prefix-free machine ⋮ Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) ⋮ Simplicity and likelihood: an axiomatic approach ⋮ Active Inference, Curiosity and Insight ⋮ Automatic identification of rock fracture sets using finite mixture models ⋮ Consistency of discrete Bayesian learning ⋮ Random numbers as probabilities of machine behavior ⋮ Parameter estimation of Poisson mixture with automated model selection through BYY harmony learning ⋮ Model selection by normalized maximum likelihood ⋮ General linear relations between different types of predictive complexity ⋮ Clustering of fuzzy data and simultaneous feature selection: a model selection approach ⋮ Minimum message length estimation of mixtures of multivariate Gaussian and von Mises-Fisher distributions

This page was built for publication: Minimum Message Length and Kolmogorov Complexity