On the inference of optimal descriptions
From MaRDI portal
Publication:1245956
DOI10.1016/0304-3975(77)90015-9zbMath0375.02041OpenAlexW2047095383MaRDI QIDQ1245956
Publication date: 1977
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(77)90015-9
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The extent and density of sequences within the minimal-program complexity hierarchies
- Process complexity and effective random tests
- On the Simplicity of Busy Beaver Sets
- Further Results on the Problem of Finding Minimal Length Programs for Decision Tables
- Iterated Limiting Recursion and the Program Minimization Problem
- Noncomplex sequences: characterizations and examples
- General random sequences and learnable sequences
- Toward a mathematical theory of inductive inference
- A Machine-Independent Theory of the Complexity of Recursive Functions
- On the Length of Programs for Computing Finite Binary Sequences
- On the problem of finding minimal programs for tables
- A variant of the Kolmogorov concept of complexity
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- A formal theory of inductive inference. Part I
- Language identification in the limit
This page was built for publication: On the inference of optimal descriptions
