Characterising SJT reducibility

Noam Greenberg, Andre Nies, Dan Turetsky

SJT reducibility between sets $A,B\subseteq \mathbb{N}$ is defined by $A{\le }_{SJT}B$ if for each computable function $h$ that is unbounded and nondecreasing, there is an $h$-bound…