Randomness conservation inequalities; information and independence in mathematical theories
- 1 April 1984
- journal article
- Published by Elsevier in Information and Control
- Vol. 61 (1) , 15-37
- https://doi.org/10.1016/s0019-9958(84)80060-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMSRussian Mathematical Surveys, 1970
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1969
- The definition of random sequencesInformation and Control, 1966
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966
- A formal theory of inductive inference. Part IInformation and Control, 1964
- Problems of formulation for artificial intelligenceProceedings of Symposia in Applied Mathematics, 1962
- On the concept of a random sequenceBulletin of the American Mathematical Society, 1940
- Mathematical problemsBulletin of the American Mathematical Society, 1902