Amanote Research

Amanote Research

    RegisterSign In

Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity

IEEE Transactions on Information Theory - United States
doi 10.1109/18.825807
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
Date

March 1, 2000

Authors
P.M.B. Vitanyi
Publisher

Institute of Electrical and Electronics Engineers (IEEE)


Related search

Minimum Description Length Revisited

International Journal of Mathematics for Industry
2019English

Minimum Description Length Principle

English

An Empirical Study of Minimum Description Length Model Selection With Infinite Parametric Complexity

Journal of Mathematical Psychology
Applied MathematicsPsychology
2006English

Minimum Description Length Shape and Appearance Models

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Kolmogorov Complexity and Algorithmic Randomness

Mathematical Surveys and Monographs
2017English

Substructure Discovery Using Minimum Description Length and Background Knowledge

Journal of Artificial Intelligence Research
Artificial Intelligence
1994English

Groupwise Non-Rigid Registration: The Minimum Description Length Approach

2004English

Combinatorial Interpretation of Kolmogorov Complexity

English

Time-Bounded Kolmogorov Complexity and Solovay Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy