Structures of Some Strong Reducibilities

Authors:
David R. Bélanger
Affiliations:
University of Waterloo, Waterloo, Canada N2L 3G1
Venue:
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Year:
2009

Citing 3
Cited 0

Randomness and reducibility

Journal of Computer and System Sciences
Visualization 2001 Conference (Acm

Visualization 2001 Conference (Acm
Computably enumerable sets in the solovay and the strong weak truth table degrees

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent developments in computability theory have given rise to new tools, among them the ibT and cl reducibilities, which, applications aside, are somewhat mysterious and deserve to be studied per se . This paper aims to throw some light on the little-explored degree structures induced by these new reducibilities.