Complexity-based induction systems: Comparisons and convergence theorems
- 1 July 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (4) , 422-432
- https://doi.org/10.1109/tit.1978.1055913
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A new algorithm for the recursive identification of stochastic systems using an automaton with slowly growing memoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- On Determining the Irrationality of the Mean of a Random VariableThe Annals of Statistics, 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
- Computational Complexity and Probability ConstructionsJournal of the ACM, 1970
- Logical basis for information theory and probability theoryIEEE Transactions on Information Theory, 1968
- A formal theory of inductive inference. Part IInformation and Control, 1964