Constant runtime complexity of term rewriting is semi-decidable (Q1799562)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constant runtime complexity of term rewriting is semi-decidable |
scientific article |
Statements
Constant runtime complexity of term rewriting is semi-decidable (English)
0 references
19 October 2018
0 references
computational complexity
0 references
decidability
0 references
formal methods
0 references
program correctness
0 references
term rewriting
0 references
