JC   2006
Wall of Fame | Most Viewed JC-2006 Paper
139views more  JC 2006»
9 years 9 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
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source139
2Download preprint from source115
3Download preprint from source105
4Download preprint from source97
5Download preprint from source87
6Download preprint from source86
7Download preprint from source68
8Download preprint from source62
9Download preprint from source62
10Download preprint from source61
11Download preprint from source57
12Download preprint from source55
13Download preprint from source53
14Download preprint from source53
15Download preprint from source35