Kolmogorov–Loveland randomness and stochasticity
- 1 March 2006
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 138 (1-3) , 183-210
- https://doi.org/10.1016/j.apal.2005.06.011
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Kolmogorov complexity characterization of constructive Hausdorff dimensionInformation Processing Letters, 2002
- A characterization of c.e. random realsTheoretical Computer Science, 2002
- Feasible reductions to kolmogorov-loveland stochastic sequencesTheoretical Computer Science, 1999
- Mathematical metaphysics of randomnessTheoretical Computer Science, 1998
- On tables of random numbersTheoretical Computer Science, 1998
- On hausdorff and topological dimensions of the kolmogorov complexity of the real lineJournal of Computer and System Sciences, 1994
- Can an individual sequence of zeros and ones be random?Russian Mathematical Surveys, 1990
- A unified approach to the definition of random sequencesTheory of Computing Systems, 1971
- The definition of random sequencesInformation and Control, 1966
- A New Interpretation of the von Mises' Concept of Random SequenceMathematical Logic Quarterly, 1966