Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T05:42:28.656Z Has data issue: false hasContentIssue false

Lowness for the class of random sets

Published online by Cambridge University Press:  12 March 2014

Antonín Kučera
Affiliation:
Department of Computer Science, Charles University, Malostranské Náměstí 25, 11800 Praha 1, Czech Republic, E-mail: kucera@ktisun2.ms.mff.cuni.cz
Sebastiaan A. Terwijn
Affiliation:
Faculteit Wins/ILLC, Universiteit Van Amsterdam, Plantage Muidergracht 24, 1018 Tv Amsterdam, The Netherlands, E-mail: terwijn@wins.uva.nl

Abstract

A positive answer to a question of M. van Lambalgen and D. Zambella whether there exist nonrecursive sets that are low for the class of random sets is obtained. Here a set A is low for the class RAND of random sets if RAND = RANDA.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable