Please use this identifier to cite or link to this item: https://doi.org/10.1137/S0097539704446323
Title: Lowness for the class of schnorr random reals
Authors: Kjos-Hanssen, B.
Nies, A.
Stephan, F. 
Keywords: Computability theory
Lowness
Randomness
Recursion theory
Schnorr randomness
Turing degrees
Issue Date: 2005
Source: Kjos-Hanssen, B., Nies, A., Stephan, F. (2005). Lowness for the class of schnorr random reals. SIAM Journal on Computing 35 (3) : 647-657. ScholarBank@NUS Repository. https://doi.org/10.1137/S0097539704446323
Abstract: We answer a question of Ambos-Spies and Kucera in the affirmative. They asked whether, when a real is low for Schnorr randomness, it is already low for Schnorr tests. © 2006 Society for Industrial and Applied Mathematics.
Source Title: SIAM Journal on Computing
URI: http://scholarbank.nus.edu.sg/handle/10635/39841
ISSN: 00975397
DOI: 10.1137/S0097539704446323
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

35
checked on Dec 13, 2017

WEB OF SCIENCETM
Citations

9
checked on Dec 13, 2017

Page view(s)

71
checked on Dec 19, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.