ML-1997-07: Algorithmic Randomness and Lowness

ML-1997-07: Terwijn, Sebastiaan A. and Zambella, Domenico (1997) Algorithmic Randomness and Lowness. [Report]

[img] Text (Full Text)
ML-1997-07.text.ps.gz

Download (62kB)
[img] Text (Abstract)
ML-1997-07.abstract.txt

Download (426B)

Abstract

We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion theoretic characterization of these sets and show that they all have Turing degree incomparable to 0'. This contrasts with a result of Kucera and Terwijn on sets that are low for the class of Martin­Lof random reals.

Item Type: Report
Report Nr: ML-1997-07
Series Name: Mathematical Logic and Foundations (ML)
Year: 1997
Date Deposited: 12 Oct 2016 14:40
Last Modified: 12 Oct 2016 14:40
URI: https://eprints.illc.uva.nl/id/eprint/1388

Actions (login required)

View Item View Item