Book Chapter10.1007/BFB0086116
Array nonrecursive sets and multiple permitting arguments
Rodney G. Downey,Carl G. Jockusch,Michael Stob +2 more
- 01 Jan 1990
- pp 141-173
79
TL;DR: A class of r.
read more
Abstract: We study a class of permitting arguments in which each positive requirement needs multiple permissions to succeed. Three natural examples of such constructions are given. We introduce a class of r. e. sets, the array nonrecursive sets, which consists of precisely those sets which allow enough permission for these constructions be performed. We classify the degrees of array nonrecursive sets and so classify the degrees in which each of these constructions can be performed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Computability and randomness
André Nies
- 01 Jan 2009
TL;DR: This book provides a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.
776
Mass Problems and Randomness
TL;DR: R is characterized as the unique largest weak degree of a subset of 2ω of positive measure, and it is shown that r is meet irreducible, does not join to 1, and is incomparable with all weak degrees of nonempty thin perfect subsets of 2 ω.
91
Reals which Compute Little
André Nies
- 01 Dec 2002
TL;DR: In this article, it was shown that super-lowness and jump-traceability coincide within the r.e.t. sets, but none of the properties implies the other within the ω-r.
71
Array nonrecursive degrees and genericity
Rodney G. Downey,Carl G. Jockusch,Michael Stob +2 more
- 01 Apr 1996
TL;DR: It is shown that the upward closure of the pb-generic degrees is the set of a.n.r. degrees, which is intermediate between 1-genericity and 2-Genericity, and thus to certain low degrees.
70
Chapter 13 Π10 classes in mathematics
Douglas Cenzer,Jeffrey B. Remmel +1 more
TL;DR: In this paper, it was shown that the set of solutions to a given recursive instance of the problem may be represented as an arbitrary (bounded, or recursively bounded) ∏ 0 1 class.
59
References
Semirecursive sets and positive reducibility
TL;DR: It will be shown that every degree contains a semirecursive set but that the degrees of immune semireCursive sets are precisely the nonrecursive degrees which are r.e. in 0' and that there are hypersimple sets A with A x A
263
An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees
TL;DR: In this article, a decomposition definissable du semi-treillis superieur des degres recursivement enumerables R comme l'union disjointe d'un ideal M and un filtre fort NC is defined.
Degrees in Which the Recursive Sets are Uniformly Recursive
TL;DR: This paper considers the degrees a such that the recursive sets are uniformly of degree ≦a and characterize them by the condition a’ ≦ 0, which will be used to study the relationship between Turing and many-one reducibility on the r.e. sets.
71
Minimal pairs and high recursively enumerable degrees
TL;DR: It is shown (uniformly) that every high r.e.degree of recursively enumerable degrees contains a high set in the sense of Robert W. Robinson [3].
58
Related Papers (5)
Rodney G. Downey,Carl G. Jockusch,Michael Stob +2 more
- 01 Apr 1996
Shamil Ishmukhametov
- 31 Jan 1999
Piergiorgio Odifreddi
- 01 Jan 1989
Rodney G. Downey,Denis R. Hirschfeldt +1 more
- 29 Oct 2010