On the computational content of the Brouwer fixed point theorem

DOI10.1007/978-3-642-30870-3_7MaRDI QIDQ2904393zbMATH OpenOpenAlexFDO

Authors Vasco Brattka, Stéphane Le Roux, Arno Pauly

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)

Recommendations

• Connected choice and the Brouwer fixed point theorem
• The Brouwer fixed point theorem revisited
• Effective Choice and Boundedness Principles in Computable Analysis
• Effective choice and boundedness principles in computable analysis
• Computational problems in metric fixed point theory and their Weihrauch degrees

Cited in

(14)

• A topological view on algebraic computation models
• On the computability of the set of automorphisms of the unit square
• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• Many-one reductions and the category of multivalued functions
• How constructive is constructing measures?
• On the computational content of the Bolzano-Weierstraß Principle
• Computability and analysis, a historical approach
• The Brouwer fixed point theorem revisited
• Finite choice, convex choice and finding roots
• Computational problems in metric fixed point theory and their Weihrauch degrees
• The Brouwer invariance theorems in reverse mathematics
• Computable Følner monotilings and a theorem of Brudno
• Connected choice and the Brouwer fixed point theorem
• The computational content of Walras' existence theorem

This page was built for publication: On the computational content of the Brouwer fixed point theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904393)