Computing with sequences, weak topologies and the axiom of choice

Authors:
Vasco Brattka;Matthias Schröder
Affiliations:
Department of Mathematics & Applied Mathematics, University of Cape Town, Rondebosch, South Africa;LFCS, School of Informatics, University of Edinburgh, Edinburgh, UK
Venue:
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Year:
2005

Citing 3
Cited 2

Complexity theory of real functions

Complexity theory of real functions
Computable analysis: an introduction

Computable analysis: an introduction
Extended admissibility

Theoretical Computer Science

Towards computability of elliptic boundary value problems in variational formulation

Journal of Complexity
On Computable Compact Operators on Banach Spaces

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines. We prove that under the Axiom of Choice non-separable normed spaces cannot even be admissibly represented with respect to any compatible topology (a compatible topology is one which makes all bounded linear functionals continuous). Surprisingly, it turns out that when one replaces the Axiom of Choice by the Axiom of Dependent Choice and the Baire Property, then some non-separable normed spaces can be represented admissibly on Turing machines with respect to the weak topology (which is just the weakest compatible topology). Thus the ability to adequately handle sequence spaces on Turing machines sensitively relies on the underlying axiomatic setting.