Showing math.LOShow all
3 papers · 1 filter
math.LO2025
Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
Peter Hertling, Philip Janicki
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we investigate the Kolmogorov complex…
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.LO2023
Reordered Computable Numbers
Philip Janicki
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset…