A total Solovay reducibility and totalizing of the notion of speedability

Abstract

While the set of Martin-Löf random left-c.e. reals is equal to the maximum degree of Solovay reducibility, Miyabe, Nies and Stephan(DOI:10.4115/jla.2018.10.3) have shown that the left-c.e. Schnorr random reals are not closed upwards under Solovay reducibility. Recall that for two left-c.e. reals~$\alpha$ and~$\beta$, the former is Solovay reducible to the latter in case there is a partially computable function $\phi$ and constant~$c$ such that for all rational numbers $q<\beta$ we have \[α- φ(q) < c(β- q).\] By requiring the translation function $\phi$ to be total, we introduce a total version of Solovay reducibility that implies Schnorr reducibility. Accordingly, by Downey and Griffiths (DOI:10.2178/jsl/1082418542), the set of Schnorr random left-c.e. reals is closed upwards relative to total Solovay reducibility. Furthermore, we observe that the notion of speedability introduced by Merkle and Titov (DOI:10.1007/978-3-030-50026-9_22) can be equivalently characterized via partial computable translation functions in a way that resembles Solovay reducibility. By requiring the translation function to be total, we obtain the concept of total speedability. Like for speedability, this notion does not depend on the choice of the speeding constant.

A revised version of the article of the same name included in Processing of the Panhellenic Logic Symposium vol. II (2022) (the original is available at the link http://panhellenic-logic-symposium.org/13/proceedings-2022.pdf)