Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,459,813 papers from all fields of science
Search
Sign In
Create Free Account
Low (computability)
Known as:
Low
In computability theory, a Turing degree [X] is low if the Turing jump [X′] is 0′. A set is low if it has low degree. Since every set is computable…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Broader (1)
Computability theory
König's lemma
Low basis theorem
PA degree
Ramsey's theorem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Bounded low and high sets
Bernard A. Anderson
,
Barbara F. Csima
,
K. Lange
Archive for Mathematical Logic
2017
Corpus ID: 32681331
Anderson and Csima (Notre Dame J Form Log 55(2):245–264, 2014) defined a jump operator, the bounded jump, with respect to bounded…
Expand
2014
2014
The Journal of Symßolrc Loctc Variations on Promptly Simple Sets
IùOLFGANG MAASSl
2014
Corpus ID: 50515673
$ ther all low sets with the o make the role of low f automorPhisms of the us. It turns out that two new properties of r.e. sets…
Expand
2007
2007
Development of a Notational Analysis System to Evaluate Setting Performance in Volleyball
N. Mortensen
2007
Corpus ID: 118203554
DEVELOPMENT OF A NOTATIONAL ANALYSIS SYSTEM TO EVALUATE SETTING PERFORMANCE IN VOLLEYBALL Nina Puikkonen Mortensen Department of…
Expand
1994
1994
Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars
Arturo Trujillo
International Conference on Computational…
1994
Corpus ID: 100303
This paper describes an algorithm for the computation of FIRST and FOLLOW sets for use with feature-theoretic grammars, in which…
Expand
1991
1991
On polynomial-time truth-table reducibility of intractable sets to P-selective sets
Seinosuke Toda
Mathematical Systems Theory
1991
Corpus ID: 7376394
The existence of setsnot being ≤ttP-reducible to low sets is investigated for several complexity classes such as UP, NP, the…
Expand
1988
1988
AN ORACLE CHARACTERIZATION OF THE COUNTING HIERARCHY
Jacobo Torb
,
Pau Gargallo
1988
Corpus ID: 209065630
The polynomial time counting hierarchy (CH), was introduced by Wagner in [16]. In this article we study certain properties of the…
Expand
Review
1974
Review
1974
Deficiency sets and bounded information reducibilities
L. Sasso
1974
Corpus ID: 2220886
For recursively enumerable sets A and H of natural numbers H is a deficiency set of A if there is a one-one, recursive function f…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE