Minimal-program complexity of pseudo-recursive and pseudo-random sequences
- 1 March 1975
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 9 (1) , 83-94
- https://doi.org/10.1007/bf01698128
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Minimal-program complexity of sequences with restricted resourcesInformation and Control, 1973
- Zufälligkeit und WahrscheinlichkeitLecture Notes in Mathematics, 1971
- A variant of the Kolmogorov concept of complexityInformation and Control, 1969
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1969
- Logical basis for information theory and probability theoryIEEE Transactions on Information Theory, 1968
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966
- Classes of Recursively Enumerable Sets and Degrees of UnsolvabilityMathematical Logic Quarterly, 1966
- A New Interpretation of the von Mises' Concept of Random SequenceMathematical Logic Quarterly, 1966
- Retraceable SetsCanadian Journal of Mathematics, 1958
- On the concept of a random sequenceBulletin of the American Mathematical Society, 1940