Polygraphic programs and polynomial-time functions

Details Polygraphic programs and polynomial-time functions Polygraphic programs and polynomial-time functions

2007-01-05

arxiv.org/abs/cs/0701032v4

Logical Methods in Computer Science 5(2:14):1-37 (2009)

Computer Science

Logic in Computer Science

Logical Methods in Computer Science (to appear), 37 pages, 1 colour picture, corrected typos

Scientific paper

10.2168/LMCS-5(2:14)2009

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a Turing-complete computational model. Their algebraic structure is used by analysis tools, called polygraphic interpretations, for complexity analysis. In particular, we delineate a subclass of polygraphic programs that compute exactly the functions that are Turing-computable in polynomial time.

Affiliated with

Also associated with

No associations

Rating

Polygraphic programs and polynomial-time functions 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 Polygraphic programs and polynomial-time functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polygraphic programs and polynomial-time functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-16114