Abstract: | A new reducibility between Turing and weak truth-table reducibility is defined, which gives an affirmative answer to the open question about the existence of such an intermediate reducibility proposed formally by M. Stob. Mathematics Subject Classification: 03D25. |