Computational Complexity of One-Tape Turing Machine Computations (Q5545959): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087008115 / rank
 
Normal rank

Latest revision as of 01:40, 20 March 2024

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

    Computational Complexity of One-Tape Turing Machine Computations (English)
    0 references
    1968
    0 references
    recursion theory, constructive mathematics
    0 references
    0 references

    Identifiers