COMPUTABILITY ON NON-SEPARABLE BANACH SPACES AND LANDAU'S THEOREM

Type: Book-Chapter

Publication Date: 2005-10-06

Citations: 13

DOI: https://doi.org/10.1093/acprof:oso/9780198566519.003.0021

Locations

  • Oxford University Press eBooks - View

Similar Works

Action Title Year Authors
+ Computability of Banach space principles 2001 Vasco Brattka
+ On the Borel Complexity of Hahn-Banach Extensions 2005 Vasco Brattka
+ On Computable Compact Operators on Banach Spaces 2007 Vasco Brattka
Ruth Dillhage
+ Computable structure theory on Banach spaces 2019 Tyler Brown
+ Computability Structures on a Banach Space 2017 Marian Boykan Pour‐El
J. Ian Richards
+ Computing with Sequences, Weak Topologies and the Axiom of Choice 2005 Vasco Brattka
Matthias Schröder
+ Bounded time computation on metric spaces and Banach spaces 2017 Matthias Schröder
Florian Steinberg
+ Bounded time computation on metric spaces and banach spaces 2017 Matthias Schröder
Florian Steinberg
+ PDF Chat Bounded time computation on metric spaces and Banach spaces 2017 Matthias Schröder
Florian Steinberg
+ Computable and Continuous Partial Homomorphisms on Metric Partial Algebras 2003 V. Stoltenberg-Hansen
John V. Tucker
+ On Reducibility And Quasireducibility Of Operators In Hilbert Spaces 2015 Rose K Masisa
+ Computability and continuity in metric partial algebras equipped with computability structures 2004 Fredrik Dahlgren
+ Computable Banach spaces via domain theory 1999 Abbas Edalat
Philipp Sünderhauf
+ How incomputable is the separable Hahn-Banach theorem? 2008 Guido Gherardi
Alberto Marcone
+ How incomputable is the separable Hahn-Banach theorem? 2008 Guido Gherardi
Alberto Marcone
+ A Bit of Functional Analysis 2020 Alberto Valli
+ A Bit of Functional Analysis 2023 Alberto Valli
+ Computability on computable metric spaces 1993 Klaus Weihrauch
+ PDF Chat Banach spaces that have normal structure and are isomorphic to a Hilbert space 1984 Javier Bernal
Frank Sullivan
+ Computability and continuity in computable metric partial algebras equipped with computability structures 2004 Fredrik Dahlgren