Computational Complexity of One-Tape Turing Machine Computations (Q5545959)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3259898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
