## Predicative Recursion and Computational Complexity, Ph.D

- Bellantoni, Stephen
- Computational Complexity
- 1992

Our purpose here is to focus attention on a development in computer science that has remarkable implications for the philosophy of mathematics. Bellantoni and Cook [BC] gave a purely syntactical characterization of polynomial-time computation. They indicate that their work was strongly influenced by previous work of Leivant, who subsequently [L] gave a more… (More)

Sorry, we couldn't extract any figures or tables for this paper.