An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
- Cite this paper as:
- de Carvalho D., Simonsen J.G. (2014) An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting. In: Dowek G. (eds) Rewriting and Typed Lambda Calculi. RTA 2014. Lecture Notes in Computer Science, vol 8560. Springer, Cham
We define the class of constrained cons-free rewriting systems and show that this class characterizes P, the set of languages decidable in polynomial time on a deterministic Turing machine. The main novelty of the characterization is that it allows very liberal properties of term rewriting, in particular non-deterministic evaluation: no reduction strategy is enforced, and systems are allowed to be non-confluent.
Unable to display preview. Download preview PDF.