Muchnik degrees and Medvedev degrees of the randomness notions

履歴
2018年3月11日 投稿

タイトル
Muchnik degrees and Medvedev degrees of the randomness notions

種類
正論文

国際会議と雑誌
TBA

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