On the inference of optimal descriptions
type: Item
instance of: scholarly article
title: On the inference of optimal descriptions
zbMATH Open document ID: 0375.02041
DOI: 10.1016/0304-3975(77)90015-9
author: K. Appert
published in: Theoretical Computer Science
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D99
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 3583804
MaRDI profile type: Publication
full work available at URL: 0304-3975(77)90015-9
OpenAlex ID: W2047095383
cites work: Q5588648
cites work: Q5670186
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Toward a mathematical theory of inductive inference
cites work: On the Length of Programs for Computing Finite Binary Sequences
cites work: The extent and density of sequences within the minimal-program complexity hierarchies
cites work: Noncomplex sequences: characterizations and examples
cites work: On the Simplicity of Busy Beaver Sets
cites work: Language identification in the limit
cites work: Q3214803
cites work: Q4070738
cites work: A variant of the Kolmogorov concept of complexity
cites work: On the problem of finding minimal programs for tables
cites work: Further Results on the Problem of Finding Minimal Length Programs for Decision Tables
cites work: Q5341753
cites work: Q5573961
cites work: Q5623666
cites work: Process complexity and effective random tests
cites work: General random sequences and learnable sequences
cites work: Iterated Limiting Recursion and the Program Minimization Problem
cites work: A formal theory of inductive inference. Part I
cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
description: scientific article; zbMATH DE number 3583804