Polygraphic programs and polynomial-time functions
计算机科学中的逻辑
2015-07-01 v4 计算复杂性
范畴论
摘要
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.
引用
@article{arxiv.cs/0701032,
title = {Polygraphic programs and polynomial-time functions},
author = {Guillaume Bonfante and Yves Guiraud},
journal= {arXiv preprint arXiv:cs/0701032},
year = {2015}
}
备注
Logical Methods in Computer Science (to appear), 37 pages, 1 colour picture, corrected typos