Computability in Europe 2008
Logic and Theory of Algorithms
|Speaker:||Petrus H. Potgieter|
|Slot:||Tue, 12:00-12:20, Amphitheater A (col. 1)|
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 shows the BFPT to be equivalent to the weak KÃ¶nig lemma in RCA$_0$ (the system of recursive comprehension) and this result is illustrated by relating the weak KÃ¶nig lemma directly to the Baigger example.
|websites: Arnold Beckmann||
Warning: date(): It is not safe to rely on the system's timezone settings. You are *required* to use the date.timezone setting or the date_default_timezone_set() function. In case you used any of those methods and you are still getting this warning, you most likely misspelled the timezone identifier. We selected the timezone 'UTC' for now, but please set date.timezone to select your timezone. in /srv/www/htdocs-cs/cie08/conf-code.php on line 136