Computability in Europe 2006
Logical Approaches to Computational Barriers
|THIS TALK HAS BEEN CANCELLED!!!|
In this paper we consider a collection of reducibilities which are intermediate between Turing and truth table reducibilities and study properties of these reducibilities relatively to infinite levels of the Ershov hierarchy which are defined by means of limit constructive ordinals.
|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/cie06/conf-code.php on line 135