347 search results - page 2 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
122
Voted
JC
2006
15 years 3 months ago
2006
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...
144
Voted
STACS
2012
Springer
13 years 11 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
137
Voted
Lecture Notes
"These lecture notes treat various versions of the so-called “fundamental theorem
of asset pricing”. Many students are familiar with statements about models for
financia...
84
Voted
ENTCS
2008
15 years 3 months ago
2008
We de ne the e ective integrability of Fine-computable functions and e ectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theo...
129
Voted
SIAMCOMP
2008
15 years 3 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...