On equivalence relations and bounded turing degrees
This thesis examines three areas in computability theory. In Chapter 2 we look at certain classes of equivalence relations under computable reducibility. In Chapters 3 and 4 we examine the bounded jump operator and the notion of highness for the bounded jump. In Chapter 5 we look at differen...
Main Author: | Yu, Hongyuan |
---|---|
Other Authors: | Ng Keng Meng |
Format: | Thesis |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/75914 |
Similar Items
-
Complexity of equivalence relations and preorders from computability theory
by: Ianovski, Egor, et al.
Published: (2015) -
Contributions to degree structures
by: Wang, Shenling
Published: (2011) -
Degree structures below 0'
by: Liu, Jiang
Published: (2010) -
Nonhemimaximal degrees and the high/low hierarchy
by: Fang, Chengling, et al.
Published: (2013) -
A Galois connection between Turing jumps and limits
by: Vasco Brattka
Published: (2018-08-01)