投稿

投稿日:

Schnorr Layerwise Computability

タイトル
Schnorr Layerwise Computability

種類
口頭発表

発表場所
証明論及び計算可能性理論に関するワークショップ
“Workshop on Proof Theory and Computability Theory 2012”
2012年2月20日-23日
ワークショップのウェブサイト

アブストラクト
In order to formalize the notion of randomness mathematically,
the theory of algorithmic randomness uses computability theory.
Recent researches show that some notions in algorithmic randomness conversely
are useful to study computable analysis.
One example is layerwise computability defined by Hoyrup and Rojas 2009.
In this talk I introduce Schnorr layerwise computability,
which is a Schnorr-randomness version,
and explain why this is a more natural notion.

ダウンロード
スライド

投稿日:

An integral test for Schnorr randomness and its application

本論文の結果はL1-computability, layerwise computability and Solovay reducibilityに含めることになりました．

履歴
2012年1月26日投稿

タイトル
An integral test for Schnorr randomness and its application

種類
論文

国際会議と雑誌
投稿中

Abstract
The author proposed in the previous paper that a characterization of a randomness notion by integral tests is a useful tool to study the relation between algorithmic randomness and computable analysis. In this paper we give a version of Schnorr randomness. With this result we show the connection between L1-computability and Schnorr layerwise computability. Finally we apply them to study the points on which two Radon-Nikodym derivatives are equal.

ダウンロード
preprint