Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze (Q3732943)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze |
scientific article |
Statements
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze (English)
0 references
1986
0 references
computational complexity
0 references
exponential time
0 references
decision problems
0 references
strong equivalence
0 references
recursive programming language
0 references
executability
0 references
computational identity
0 references
totality
0 references
divergence
0 references
partial correctness
0 references
total correctness
0 references
