AbstractWe give a correspondence between two notions of complexity for real functions: poly-time computability according to Ko and a notion that arises naturally when one considers the application of Mehlhorn's class of the basic feasible functionals to computable analysis. We show that both notions define the same set of polynomial-time computable real functions
We present a Coq library that allows for readily proving that a function is computable in polynomial...
A famous result due to Ko and Friedman (Theoretical Computer Science 20 (1982) 323–352) asserts that...
International audienceReal complexity theory is a resource-bounded refinement of computable analysis...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
objects encountered in analysis, such as real functions, from the viewpoints of computability and co...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
Abstract. In this paper, we study computability and complexity of real functions. We extend these no...
[1955]. It is based on a discrete mechanical framework that can be used to model computation over th...
AbstractWe consider the Ko–Friedman notion of (non-uniform) time complexity for real functions appro...
AbstractRecursive analysis, the theory of computation of functions on real numbers, has been studied...
Computable analysis studies problems involving real numbers, sets and functions from the viewpoint o...
In this paper we develop an approach to the notion of computable functionals in a very abstract sett...
Abstract. Recursive analysis is the most classical approach to model and discuss compu-tations over ...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
Accepted for publication in International Journal of Unconventional ComputingInternational audienceR...
We present a Coq library that allows for readily proving that a function is computable in polynomial...
A famous result due to Ko and Friedman (Theoretical Computer Science 20 (1982) 323–352) asserts that...
International audienceReal complexity theory is a resource-bounded refinement of computable analysis...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
objects encountered in analysis, such as real functions, from the viewpoints of computability and co...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
Abstract. In this paper, we study computability and complexity of real functions. We extend these no...
[1955]. It is based on a discrete mechanical framework that can be used to model computation over th...
AbstractWe consider the Ko–Friedman notion of (non-uniform) time complexity for real functions appro...
AbstractRecursive analysis, the theory of computation of functions on real numbers, has been studied...
Computable analysis studies problems involving real numbers, sets and functions from the viewpoint o...
In this paper we develop an approach to the notion of computable functionals in a very abstract sett...
Abstract. Recursive analysis is the most classical approach to model and discuss compu-tations over ...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
Accepted for publication in International Journal of Unconventional ComputingInternational audienceR...
We present a Coq library that allows for readily proving that a function is computable in polynomial...
A famous result due to Ko and Friedman (Theoretical Computer Science 20 (1982) 323–352) asserts that...
International audienceReal complexity theory is a resource-bounded refinement of computable analysis...
DOI
Add to ORKG