Presentation 2013/3/11
Schnorr and Kurtz randomness versions of Merkle's criterion
Kenshi MIYABE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In the theory of algorithmic randomness, Martin-Lof randomness has been well studied and we have known many characterizations of Martin-Lof randomness. Merkle's criterion is one of them and it is a useful result, for instance, to construct a non-random set. In this paper, we give Schnorr and Kurtz randomness versions.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) algorithmic randomness / Merkle's criterion / Schnorr randomness / Kurtz randomness
Paper # C0MP2012-60
Date of Issue

Conference Information
Committee COMP
Conference Date 2013/3/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Schnorr and Kurtz randomness versions of Merkle's criterion
Sub Title (in English)
Keyword(1) algorithmic randomness
Keyword(2) Merkle's criterion
Keyword(3) Schnorr randomness
Keyword(4) Kurtz randomness
1st Author's Name Kenshi MIYABE
1st Author's Affiliation Research Institute for Mathematical Sciences, Kyoto University()
Date 2013/3/11
Paper # C0MP2012-60
Volume (vol) vol.112
Number (no) 498
Page pp.pp.-
#Pages 5
Date of Issue