Pseudo-jump inversion and SJT-hard sets

Noam Greenberg; Rodney G. Downey

arxiv: 1109.6752 · v1 · pith:QHRK6CMVnew · submitted 2011-09-30 · 🧮 math.LO

Pseudo-jump inversion and SJT-hard sets

Rodney G. Downey , Noam Greenberg This is my paper

classification 🧮 math.LO

keywords setspseudo-jumpsjt-hardavoidingbackcannotcomputablecone

0 comments

read the original abstract

There are noncomputable c.e.\ sets, computable from every SJT-hard c.e.\ set. This yields a natural pseudo-jump operator, increasing on all sets, which cannot be inverted back to a minimal pair or even avoiding an upper cone.

This paper has not been read by Pith yet.

Pseudo-jump inversion and SJT-hard sets

discussion (0)