Polynomial time computation in the context of recursive analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Polynomial time computation in the context of recursive analysis

Walid Gomaa
  • Function : Author
  • PersonId : 863698


Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955] as an approach for investigating computation over the real numbers. It is based on enhancing the Turing machine model by introducing oracles that allow the machine to access finitary portions of the real infinite objects. Classes of computable real functions have been extensively studied as well as complexity-theoretic classes of functions restricted to compact domains. However, much less have been done regarding complexity of arbitrary real functions. In this article we give a definition of polynomial time computability of arbitrary real functions. Then we present two main applications based on that definition. The first one, which has already been published, concerns the relationships between polynomial time real computability and the corresponding notion over continuous rational functions. The second application, which is a new contribution to this article, concerns the construction of a function algebra that captures polynomial time real computability.

Dates and versions

hal-00758332 , version 1 (28-11-2012)



Walid Gomaa. Polynomial time computation in the context of recursive analysis. First International Workshop on Foundational and Practical Aspects of Resource Analysis - FOPARA 2009, Nov 2009, Eindhoven, Netherlands. pp.146-162, ⟨10.1007/978-3-642-15331-0_10⟩. ⟨hal-00758332⟩
149 View
0 Download



Gmail Facebook Twitter LinkedIn More