scientific article; zbMATH DE number 3605746
From MaRDI portal
Publication:4171408
zbMath0389.62003MaRDI QIDQ4171408
Publication date: 1978
Full work available at URL: http://www.numdam.org/item?id=AIHPB_1978__14_1_113_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Process complexity and effective random tests
- A Theory of Program Size Formally Identical to Information Theory
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- A unified approach to the definition of random sequences
- Computational Complexity and Probability Constructions