Computational Complexity of One-Tape Turing Machine Computations (Q5545959)

From MaRDI portal
Revision as of 02:40, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3259898
Language Label Description Also known as
English
Computational Complexity of One-Tape Turing Machine Computations
scientific article; zbMATH DE number 3259898

    Statements

    title
    Computational Complexity of One-Tape Turing Machine Computations (English)
    0 references
    DOI
    10.1145/321450.321464
    0 references
    publication date
    1968
    0 references
    zbMATH DE Number
    3259898
    0 references
    zbMATH Keywords
    recursion theory, constructive mathematics
    0 references
    author
    Juris Hartmanis
    0 references
    OpenAlex ID
    W2087008115
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5545959&oldid=32832961"
    Powered by MediaWiki