The Complexity of Strict Minimum Message Length Inference

DOI10.1093/comjnl/45.3.285zbMath1003.68055OpenAlexW1990495631MaRDI QIDQ4551652

Chris Wallace, Graham E. Farr

Publication date: 6 October 2002

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

Full work available at URL: https://doi.org/10.1093/comjnl/45.3.285

zbMATH Keywords

strict minimum message length

Mathematics Subject Classification ID

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

Related Items (3)

Minimum message length estimation using EM methods: a case study ⋮ Minimum message length inference of the Poisson and geometric models using heavy-tailed prior distributions ⋮ Minimum message length shrinkage estimation

This page was built for publication: The Complexity of Strict Minimum Message Length Inference