an:01531917
Zbl 0962.03039
Ambos-Spies, Klaus; Ku??era, Anton??n
Randomness in computability theory
EN
Cholak, Peter A. (ed.) et al., Computability theory and its applications. Current trends and open problems. Proceedings of a 1999 AMS-IMS-SIAM joint summer research conference, Boulder, CO, USA, June 13-17, 1999. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 257, 1-14 (2000).
2000
a
03D80 03D28 68Q30
algorithmic randomness; computably random sequence; Turing degrees; Martin-L??f random sets; relativized randomness; oracles
Summary: We discuss some aspects of algorithmic randomness and state some open problems in this area. The first part is devoted to the question ``What is a computably random sequence?'' Here we survey some of the approaches to algorithmic randomness and address some questions on these concepts. In the second part we look at the Turing degrees of Martin-L??f random sets. Finally, in the third part we deal with relativized randomness. Here we look at oracles which do not change randomness.
For the entire collection see [Zbl 0945.00017].