Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) (Q6137845): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Unification Modulo Synchronous Distributivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formalization of multi-tape Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The surveyability of mathematical proof: A historical perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2852343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Forward Closure and the Finite Variant Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6124949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of PCP-related computational reductions in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: A certifying extraction with time bounds from Coq to call-by-value $\lambda$-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the Turing machine immortality problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Immortal Configurations in Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tiling Problem Revisited (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity and Immortality in Reversible Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small universal register machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the semi-unification problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of ML typability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5094119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of type polymorphism in programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typability and type checking in System F are equivalent and undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:22, 23 August 2024

scientific article; zbMATH DE number 7788994
Language Label Description Also known as
English
Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
scientific article; zbMATH DE number 7788994

    Statements

    Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) (English)
    0 references
    0 references
    16 January 2024
    0 references
    constructive mathematics
    0 references
    computability theory
    0 references
    undecidability
    0 references
    semi-unification
    0 references
    mechanization
    0 references
    Coq
    0 references

    Identifiers