4 papers
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…
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…
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…
Benign approximations and non-speedability
Rupert Hölzl, Philip Janicki
A left-computable number is called regainingly approximable if there is a computable increasing sequence of rational numbers converging to such that $x - x_n < 2^…