3 papers
math.LO2026
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…
math.LO2024
Randomness versus superspeedability
Rupert Hölzl, Philip Janicki, Wolfgang Merkle +1
Speedable numbers are real numbers which are algorithmically approximable from below and whose approximations can be accelerated nonuniformly. We begin this article by answering a…
math.LO2024
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…