347 search results - page 4 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
CIE
2006
Springer
15 years 1 months ago
2006
Springer
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
AML
2008
14 years 9 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
BSL
2008
14 years 9 months ago
2008
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
104
click to vote
NPC
2005
Springer
15 years 3 months ago
2005
Springer
The Globus Toolkit (GT) has been developed since the late 1990s to support the development of service-oriented distributed computing applications and infrastructures. Core GT compo...