scientific article; zbMATH DE number 3591877

zbMath0379.94031MaRDI QIDQ4158957

Jacques-Edouard Dies

Publication date: 1976

Full work available at URL: http://www.numdam.org/item?id=AIHPB_1976__12_4_365_0

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Statistical aspects of information-theoretic topics (62B10)

Related Items (2)

Unnamed Item ⋮ Organization by rules in finite sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Process complexity and effective random tests
• A Theory of Program Size Formally Identical to Information Theory
• A Method for the Construction of Minimum-Redundancy Codes
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Computational Complexity and Probability Constructions
• The definition of random sequences

This page was built for publication: