Intensional properties of polygraphs
计算机科学中的逻辑
2008-10-07 v2 计算复杂性
范畴论
摘要
We present polygraphic programs, a subclass of Albert Burroni's polygraphs, as a computational model, showing how these objects can be seen as first-order functional programs. We prove that the model is Turing complete. We use polygraphic interpretations, a termination proof method introduced by the second author, to characterize polygraphic programs that compute in polynomial time. We conclude with a characterization of polynomial time functions and non-deterministic polynomial time functions.
引用
@article{arxiv.cs/0703007,
title = {Intensional properties of polygraphs},
author = {Guillaume Bonfante and Yves Guiraud},
journal= {arXiv preprint arXiv:cs/0703007},
year = {2008}
}
备注
Proceedings of TERMGRAPH 2007, Electronic Notes in Computer Science (to appear), 12 pages, minor changes from previous version