2008
DOI: 10.1142/9789812796554_0005
|View full text |Cite
|
Sign up to set email alerts
|

Lowness for Computable Machines

Abstract: Two lowness notions in the setting of Schnorr randomness have been studied (lowness for Schnorr randomness and tests, by Terwijn and Zambella [19], and by Stephan, and Nies [7]; and Schnorr triviality, by Downey, Griffiths and LaForte [3,4] and Franklin [6]). We introduce lowness for computable machines, which by results of Downey and Griffiths [3] is an analog of lowness for K. We show that the reals that are low for computable machines are exactly the computably traceable ones, and so this notion coincides … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…Lowness for Schnorr randomness has previously been studied in the literature such as [9,18,8]. However, lowness for uniform Schnorr randomness has more natural properties [15,22,21].…”
Section: Introductionmentioning
confidence: 99%
“…Lowness for Schnorr randomness has previously been studied in the literature such as [9,18,8]. However, lowness for uniform Schnorr randomness has more natural properties [15,22,21].…”
Section: Introductionmentioning
confidence: 99%
“…Similarly, the lowness notions for Schnorr randomness have been studied [7,8,15,6]. Unlike the case of Martin-Löf randomness, lowness for Schnorr randomness is not equivalent to Schnorr triviality, which is a Schnorr-randomness version of K-triviality [8].…”
Section: Introductionmentioning
confidence: 99%