Computability in Europe 2008
Logic and Theory of Algorithms
|Slot:||Fri, 11:40-12:00, Amphitheater A (col. 1)|
I will outline a method for deriving lower bounds for the complexity of problems (especially in arithmetic) which are absolute (universal), i.e., they apply to all algorithms; the key idea is to derive lower bounds from three axioms for algorithms, which are natural and easily shown to apply to all known models of computation.
|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