Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

JC
2006

favoriteEmaildiscussreport

139views more JC 2006»

The basic feasible functionals in computable analysis

13 years 4 months ago

The basic feasible functionals in computable analysis

Download www.brics.dk

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.

Branimir Lambov

Real-time Traffic

Basic Feasible Functionals | JC 2006 | Poly-time Computability | Real Numbers |

claim paper

Related Content

» Computable Versions of Basic Theorems in Functional Analysis

» Feasible functionals and intersection of ramified types

» An analysis of feasible solutions for multiissue negotiation involving nonlinear utility f...

» Feasible Functions over Coinductive Data

» Basic Algorithm for Attribute Implications and Functional Dependencies in Graded Setting

» Predicative Analysis of Feasibility and Diagonalization

» Some Basics on Tolerances

» Interpretation of Stream Programs Characterizing Type 2 Polynomial Time Complexity

» Feasibility of HoughTransformBased Iris Localisation for RealTimeApplication

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JC
Authors	Branimir Lambov

Comments (0)