1 citations · 1 across the 4 of their papers we have counts for
6 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^…
Nearly Computable Real Numbers
Peter Hertling, Philip Janicki
In this article we call a sequence of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function …
Regainingly approximable numbers and sets
Peter Hertling, Rupert Hölzl, Philip Janicki
We call an regainingly approximable if there exists a computable nondecreasing sequence of rational numbers converging to with for…