Computational Complexity of One-Tape Turing Machine Computations (Q5545959): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1071499 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Juris Hartmanis / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087008115 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02: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
