Publication:3905267
From MaRDI portal
zbMath0457.03042MaRDI QIDQ3905267
Publication date: 1980
lattice; Turing degrees; dense; generic degree; degrees of unsolvability; many-one degrees; n-quantifier arithmetic
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Non-p-generic and strongly nonbranching degree, Non-p-generic and strongly nonbranching degree, HIGHER RANDOMNESS AND GENERICITY, The Information Content of Typical Reals, A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE, A note on the enumeration degrees of 1-generic sets, Natural factors of the Muchnik lattice capturing IPC, The degrees of bi-hyperhyperimmune sets, The weakness of being cohesive, thin or free in reverse mathematics, Embedding and coding below a 1-generic degree, Differences between resource bounded degree structures, Generic degrees are complemented, Index sets and universal numberings, Degrees which do not bound minimal degrees, Intervals and sublattices of the r.e. weak truth table degrees. I: Density, The generic oracle hypothesis is false, Approximation methods in inductive inference, Learning via queries and oracles, Dynamic notions of genericity and array noncomputability, Extremes in the degrees of inferability, Genericity and measure for exponential time, Noisy inference and oracles, An oracle builder's toolkit, Complexity of the \(r\)-query tautologies in the presence of a generic oracle, On low for speed oracles, Generics for computable Mathias forcing, 1-generic splittings of computably enumerable degrees, Extensions of embeddings below computably enumerable degrees
