Computability in Europe 2006
Logical Approaches to Computational Barriers
|Slot:||Sat, 14:30-14:50, Faraday C (col. 2)|
We introduce a notion of complexity for sets of finite binary sequences such that the corresponding fan theorem is constructively equivalent to the uniform continuity theorem. This settles an open question.
|websites: Arnold Beckmann||2006-04-19|