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 question in a suitable way by finite binary strings and to investigate whether or how fast the problem can be solved by an algorithm or a Turing machine operating on these finite strings. But many computation problems are naturally formulated over continuous data, e.g., over real numbers, complex numbers, functions or relations over real numbers. 

• Type: Conference
• Year: 2005
• Where: CCA
• Authors: Atsushi Yoshikawa, Mariko Yasugi
• Keywords: CCA 2005, Discrete Data, Finite Binary Strings, Real Numbers, Theoretical Computer Science