Sciweavers

JC
2006
139views more  JC 2006»
13 years 11 months ago
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 cons...
Branimir Lambov