A STRONG LAW OF COMPUTATIONALLY WEAK SUBSETS
- 1 June 2011
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
- Vol. 11 (01), 1-10
- https://doi.org/10.1142/s0219061311000980
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Stable Ramsey's Theorem and MeasureNotre Dame Journal of Formal Logic, 2011
- A fixed-point-free minimal degreeJournal of the London Mathematical Society, 2009
- Lowness for Kurtz randomnessThe Journal of Symbolic Logic, 2009
- Computability and RandomnessPublished by Oxford University Press (OUP) ,2009
- Infinite Subsets of Random Sets of IntegersMathematical Research Letters, 2009
- An Introduction to Kolmogorov Complexity and Its ApplicationsPublished by Springer Science and Business Media LLC ,2008
- Comparing DNR and WWKLThe Journal of Symbolic Logic, 2004
- I. J. BienayméPublished by Springer Science and Business Media LLC ,1977
- Zufälligkeit und WahrscheinlichkeitPublished by Springer Science and Business Media LLC ,1971