The basic feasible functionals in computable analysis

Authors:
Branimir Lambov
Affiliations:
BRICS, University of Aarhus, IT Parken, 8200 Aarhus N, Denmark and FB Mathematik, AG 1, Technical University Darmstadt, Schlossgartenstrasse 7, 64289 Darmstadt, Germany
Venue:
Journal of Complexity
Year:
2006

Citing 5
Cited 1

Complexity theory of real functions

Complexity theory of real functions
A New Characterization of Type-2 Feasibility

SIAM Journal on Computing
Computable analysis: an introduction

Computable analysis: an introduction
Polynomial and abstract subrecursive classes

Journal of Computer and System Sciences
Complexity and intensionality in a type-1 framework for computable analysis

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Complexity Theory for Operators in Analysis

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.01

Visualization

Abstract

We 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.