Sciweavers

CCA
2005
Springer
13 years 6 months ago
Computable Versions of Basic Theorems in Functional Analysis
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
Atsushi Yoshikawa, Mariko Yasugi