Some lowness properties and computational complexity sequences (Q1255315): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(78)90007-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035558335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable complexity sequences and measure independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity properties of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of lists in the study of undecidable problems in automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degrees of hyperhyperimmune sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of recursively enumerable sets which have no maximal supersets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some games which are relevant to the theory of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Properties of Abstract Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of unsolvability and complexity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational speed-up by effective operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy of the Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity, speedable and levelable sets / rank
 
Normal rank

Latest revision as of 00:38, 13 June 2024

scientific article
Language Label Description Also known as
English
Some lowness properties and computational complexity sequences
scientific article

    Statements

    Some lowness properties and computational complexity sequences (English)
    0 references
    0 references
    0 references
    1978
    0 references
    Lowness Properties
    0 references
    Computational Complexity
    0 references

    Identifiers