Degrees of unsolvability associated with Markov algorithms (Q4052103): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantificational variants on the halting problem for turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many-one equivalence of some general combinatorial decision problems / 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: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Configuration and Word Problems of Given Degree of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of some general combinatorial decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5552754 / rank
 
Normal rank

Latest revision as of 16:07, 12 June 2024

scientific article
Language Label Description Also known as
English
Degrees of unsolvability associated with Markov algorithms
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references