Skip to Main content Skip to Navigation
Conference papers

Polynomial time computation in the context of recursive analysis

Walid Gomaa 1 
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Walid Gomaa Connect in order to contact the contributor
Submitted on : Wednesday, November 28, 2012 - 3:32:33 PM
Last modification on : Saturday, June 25, 2022 - 7:46:31 PM

Links full text




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⟩



Record views