Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes (Q3769965)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes |
scientific article; zbMATH DE number 4028904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes |
scientific article; zbMATH DE number 4028904 |
Statements
Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes (English)
0 references
1984
0 references
decidability
0 references
decision problems
0 references
correspondence problems
0 references
linear context- free grammars
0 references
arbitrary context-free grammars
0 references
program schemes
0 references
nonrecursive complexity
0 references
nonrecursive lower complexity bounds
0 references
undecidability results
0 references
relative economy of description
0 references
0.7439612150192261
0 references
0.7437736392021179
0 references
0.7435355186462402
0 references
