Demuth’s Path to Randomness
Osvald Demuth (1936–1988) studied constructive analysis in the Russian style. For this he introduced notions of effective null sets which, when phrased in classical language, yield major algorithmic randomness notions. He proved several results connecting constructive analysis and randomness that were rediscovered only much later.
We give an overview in mostly chronological order. We sketch a proof that Demuth’s notion of Denjoy sets (or reals) coincides with computable randomness. We show that he worked with a test notion that is equivalent to Schnorr tests relative to the halting problem. We also discuss the invention of Demuth randomness, and Demuth’s and Kučera’s work on semigenericity.
KeywordsComputable Function Random Real Computable Sequence Turing Degree Arithmetical Real
Unable to display preview. Download preview PDF.
- 2.Various Authors. Logic Blog (2011), http://dl.dropbox.com/u/370127/Blog/Blog2011.pdf
- 3.Bienvenu, L., Downey, R., Greenberg, N., Nies, A., Turetsky, D.: Lowness for Demuth randomness. Unpublished, 20xxGoogle Scholar
- 4.Bienvenu, L., Hoelzl, R., Miller, J., Nies, A.: The Denjoy alternative for computable functions (2012), http://dl.dropbox.com/u/370127/papers/BHMNStacsFinal.pdf
- 7.Brattka, V., Miller, J., Nies, A.: Randomness and differentiability (submitted)Google Scholar
- 17.Demuth, O.: Remarks on Denjoy sets, preprint (1988), http://dl.dropbox.com/u/370127/DemuthPapers/Demuth88PreprintDenjoySets.pdf
- 21.Franklin, J.N.Y., Ng, K.M.: Difference randomness. Proceedings of the American Mathematical Society (to appear)Google Scholar
- 23.Kurtz, S.: Randomness and genericity in the degrees of unsolvability. Ph.D. Dissertation, University of Illinois, Urbana (1981)Google Scholar
- 29.Nies, A.: Computably enumerable sets below random sets. Ann. Pure Appl. Logic (to appear, 2011)Google Scholar