Randomness conservation inequalities; information and independence in mathematical theories

Information and Control

Volumn 61, Issue 1, 1984, Pages 15-37

  Levin, Leonid A ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY;

COMPLEXITY THEORY; RANDOMNESS CONSERVATION INEQUALITIES;

COMPUTER PROGRAMMING;

EID: 0021404339     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(84)80060-1     Document Type: Article

References (29)

1. On the concept of random sequence
2. On the length of programs for computing finite binary sequences I II
3. On the length of programs for computing finite binary sequences I II
4. A theory of program-size formally identical to information theory
5. On the symmetry of algorithmic information
6. Mathematical problems
7. Grundbegriffe der Wahrscheinlichkeitrechung
8. Three approaches to the concept ofThe Amount of Information
9. Talk resume
10. The complexity of finite objects and the algorithmic concepts of information and randomness
11. On the notion of a random sequence
12. Universal sequential search problems
13. On storage capacity for algorithms
14. Laws of information conservation (non-growth) and aspects of the foundations of probability theory
15. On the principle of conservation of information in intuitionistic mathematics
16. Various measures of complexity for finite objects (axiomatic descriptions)
17. Uniform tests of randomness
18. Invariant Properties of Informational Bulks
19. On normal algorithms which compute boolean functions
20. The definition of random sequences
21. Problems of formulation for artificial intelligence
22. Zufaelligkeit und Wahrscheinlichkeit
23. A formal theory of inductive inference
24. The algebra of invariant properties of binary sequences