On the relation between descriptional complexity and algorithmic probability
Author:
- Péter GácsPGPéter Gács
- 1 January 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 22 (1-2) , 71-93
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Exact Expressions for Some Randomness TestsMathematical Logic Quarterly, 1980
- Mathematical GamesScientific American, 1979
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- Process complexity and effective random testsJournal of Computer and System Sciences, 1973
- 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
- A variant of the Kolmogorov concept of complexityInformation and Control, 1969
- Logical basis for information theory and probability theoryIEEE Transactions on Information Theory, 1968
- The definition of random sequencesInformation and Control, 1966
- A formal theory of inductive inference. Part IInformation and Control, 1964