Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Regular Talk:
Generalized tabular reducibilities in infinite levels of Ershov hierarchy

THIS TALK HAS BEEN CANCELLED!!!
Speaker: Marat Arslanov

Abstract

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 2006-07-01 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by www.free-counters.net