A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES (Q4637942): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q247180
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rodney G. Downey / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2800448812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post's Programme for the Ershov Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of \(N_5\) and the contiguous degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded jump for the bounded Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypersimplicity and semicomputability in the weak truth table degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kobayashi compressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer valued betting strategies and Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The importance of Π<sub>1</sub><sup>0</sup> classes in effective randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Π<sub>1</sub><sup>0</sup> classes and strong degree spectra of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal contiguous degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal pairs and high recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indifferent sets for genericity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural Large Degree Spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice nonembeddings and initial segments of the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing degrees of reals of positive effective packing dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: T-Degrees, Jump Classes, and Strong Reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contiguity and distributivity in the enumerable Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting into degrees with low computational strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree theoretic definitions of the low<sub>2</sub> recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural interactions of the recursively enumerable T- and W-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indifferent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-Complex Sets and Reducibilities with Tiny Use / rank
 
Normal rank
Property / cites work
 
Property / cites work: The role of true finiteness in the admissible recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post's program and incomplete recursively enumerable sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double jumps of minimal degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and the Recursion Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding minimal pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not every finite lattice is embeddable in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3712325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-one degrees of the predicates \(H_ a(x)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpretability and Definability in the Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable α-degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4513977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density of infima in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion Theory and Dedekind Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive well-orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284998 / rank
 
Normal rank

Latest revision as of 14:59, 15 July 2024

scientific article; zbMATH DE number 6866160
Language Label Description Also known as
English
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
scientific article; zbMATH DE number 6866160

    Statements

    A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES (English)
    0 references
    0 references
    0 references
    0 references
    3 May 2018
    0 references
    0 references
    computably enumerable
    0 references
    totally \(\alpha\)-computably approximable
    0 references
    multiple permitting
    0 references
    lattice embedding
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references