Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes (Q3769965): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/62.2737 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025340462 / rank | |||
Normal rank | |||
Latest revision as of 22:13, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes |
scientific article |
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
