4 papers · 1 filter
S2a-reducibility and differentiation in Martin-Löf random reals
Georgii Sirotenko, Ivan Titov
Solovay reducibility is studied intensively as a tool to compare the approximability and the degree of randomness of left-c.e. reals. By definition, a real is left-c.e. if it has a…
Speedability of computably approximable reals and their approximations
George Barmpalias, Nan Fang, Wolfgang Merkle +1
An approximation of a real is a sequence of rational numbers that converges to the real. An approximation is left-c.e. if it is computable and nondecreasing and is d.c.e. if it is…
Variants of Solovay reducibility
Ivan Titov
Outside of the left-c.e. reals, Solovay reducibility is considered to be behaved badly [10.1007/978-0-387-68441-3]. Proposals for variants of Solovay reducibility that are better s…
A total Solovay reducibility and totalizing of the notion of speedability
Wolfgang Merkle, Ivan Titov
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 l…