The basic feasible functionals in computable analysis

We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one considers the application of Melhorn's class of the Basic Feasible Functionals to computable analysis. We show that both notions define the same set of real numbers and functions. Key words: Basic feasible functionals. Complexity in analysis.

• Type: Journal
• Year: 2006
• Where: JC
• Authors: Branimir Lambov
• Keywords: Basic Feasible Functionals, JC 2006, Poly-time Computability, Real Numbers