A proof theoretic approach to feasible computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2000

A proof theoretic approach to feasible computation

Abstract

We introduce a first order calculus which is a syntactic restriction of Peano arithmetic. We establish that the set of functions which is provable in this calculus is exactly the set of polynomial time functions.
No file

Dates and versions

inria-00099327 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099327 , version 1

Cite

Jean-Yves Marion. A proof theoretic approach to feasible computation. [Interne] A00-R-375 || marion00d, 2000, 17 p. ⟨inria-00099327⟩
89 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More