Computable counter-examples to the Brouwer fixed-point theorem

Details Computable counter-examples to the Brouwer fixed-point theorem Computable counter-examples to the Brouwer fixed-point theorem

2008-04-21

arxiv.org/abs/0804.3199v1

Mathematics

General Mathematics

10 pages; to appear in local proceedings of Computability in Europe 2008: Logic and Theory of Algorithms

Scientific paper

This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and non-computable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for finding the fixed point in general by giving an example of a computable function which does not fix any computable point. Research in reverse mathematics has shown the BFPT to be equivalent to the weak K\"onig lemma in RCA$_0$ (the system of recursive comprehension) and this result is illustrated by relating the weak K\"onig lemma directly to the Baigger example.

Affiliated with

Also associated with

No associations

Rating

Computable counter-examples to the Brouwer fixed-point theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computable counter-examples to the Brouwer fixed-point theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computable counter-examples to the Brouwer fixed-point theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-35975