On the Computational Content of the Brouwer Fixed Point Theorem

DOI10.1007/978-3-642-30870-3_7zbMath1357.03091OpenAlexW63299231MaRDI QIDQ2904393

Stéphane Le Roux, Arno Pauly, Vasco Brattka

Publication date: 14 August 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://cronfa.swan.ac.uk/Record/cronfa37385/Download/0037385-18122017151751.pdf

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60)

Related Items (7)

Computability and Analysis, a Historical Approach ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ A topological view on algebraic computation models ⋮ Many-one reductions and the category of multivalued functions ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ How constructive is constructing measures? ⋮ On the computability of the set of automorphisms of the unit square

This page was built for publication: On the Computational Content of the Brouwer Fixed Point Theorem