A formalization of multi-tape Turing machines (Q744986): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A list-machine benchmark for mechanized metatheory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intensional content of Rice's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formal Proof of Borodin-Trakhtenbrot’s Gap Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zen and the art of formalisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalizing Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Considerations on the Usability of Interactive Provers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hints in Unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matita Interactive Theorem Prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formally verified proof of the prime number theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering formal metatheory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3247126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Formalisms for Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Checked Proof of the Odd Order Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operating system verification---an overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal certification of a compiler back-end or / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanised Computability Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanising Turing Machines and Computability Theory in Isabelle/HOL / rank
 
Normal rank

Revision as of 20:58, 10 July 2024

scientific article
Language Label Description Also known as
English
A formalization of multi-tape Turing machines
scientific article

    Statements

    A formalization of multi-tape Turing machines (English)
    0 references
    0 references
    0 references
    12 October 2015
    0 references
    Turing machines
    0 references
    universal machine
    0 references
    automatic verification
    0 references
    certified correctness
    0 references
    interactive theorem proving
    0 references
    Matita
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers