Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Regular Talk:
The Dyment reducibility on the algebraic structures and on the families of subsets of $omega$

Speaker: Iskander Kalimullin
Slot: Mon, 11:30-11:50, Faraday A (col. 1)


In the paper a positive reducibility on the special noncomputable
algebraic structures and the connected reducibilities on the families
of subsets of $\omega$ are studied. 

websites: Arnold Beckmann 2006-04-19 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by