Results 1 -
1 of
1
Five Lectures on Algorithmic Randomness
- in Computational Prospects of Infinity, ed. C.T. Chong, Proc. 2005 Singapore meeting
, 2007
"... This paper follows on from the author’s Five Lectures on Algorithmic Randomness. It is concerned with material not found in that long paper, concentrating on Martin-Löf lowness and triviality. We present a hopefully user-friendly account of the decanter method, and discuss recent results of the auth ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
This paper follows on from the author’s Five Lectures on Algorithmic Randomness. It is concerned with material not found in that long paper, concentrating on Martin-Löf lowness and triviality. We present a hopefully user-friendly account of the decanter method, and discuss recent results of the author with Peter Cholak and Noam Greenberg concerning the class of strongly jump traceable reals introduced by
