A stronger Kolmogorov zero-one law for resource-bounded measure
- 31 January 2003
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 292 (3) , 723-732
- https://doi.org/10.1016/s0304-3975(02)00320-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Resource-bounded measurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Almost everywhere high nonuniform complexityJournal of Computer and System Sciences, 1992
- Process complexity and effective random testsJournal of Computer and System Sciences, 1973
- A unified approach to the definition of random sequencesTheory of Computing Systems, 1971
- Zufälligkeit und WahrscheinlichkeitLecture Notes in Mathematics, 1971
- Klassifikation der Zufallsgesetze nach Komplexität und OrdnungProbability Theory and Related Fields, 1970
- Die elementare WahrscheinlichkeitsrechnungPublished by Springer Nature ,1933