Observation of implicit complexity by non confluence

Details Observation of implicit complexity by non confluence Observation of implicit complexity by non confluence

2010-05-04

arxiv.org/abs/1005.0519v1

EPTCS 23, 2010, pp. 15-29

Computer Science

Computational Complexity

Scientific paper

10.4204/EPTCS.23.2

We propose to consider non confluence with respect to implicit complexity. We come back to some well known classes of first-order functional program, for which we have a characterization of their intentional properties, namely the class of cons-free programs, the class of programs with an interpretation, and the class of programs with a quasi-interpretation together with a termination proof by the product path ordering. They all correspond to PTIME. We prove that adding non confluence to the rules leads to respectively PTIME, NPTIME and PSPACE. Our thesis is that the separation of the classes is actually a witness of the intentional properties of the initial classes of programs.

Affiliated with

Also associated with

No associations

Rating

Observation of implicit complexity by non confluence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Observation of implicit complexity by non confluence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Observation of implicit complexity by non confluence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532219