履歴
2018年9月 受理
2018年3月11日 投稿
タイトル
Muchnik degrees and Medvedev degrees of the randomness notions
種類
査読ありの事後会議録
国際会議と雑誌
ALC2015とALC2017の共同議事録
World Scientificから出版
Proceedings of the 14th and 15th Asian Logic Conferences, pp. 108-128 (2019) January
Abstract
The main theme of this paper is computational power when a machine is allowed to access random sets.
The computability depends on the randomness notions and we compare them by Muchnik and Medvedev degrees.
The central question is whether, given an random oracle, one can compute a more random set.
The main result is that, for each Turing functional,
there exists a Schnorr random set whose output is not computably random.
ダウンロード
Muchnikdegrees