H-monotonically Computable Real Numbers

Let h : N −→ Q be a computable function. A real number x is called h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges to x h-monotonically in the sense that h(n)|x− xn| ≥ |x− xm| for all n and m > n. In this paper we investigate classes h-MC of h-mc real numbers for different computable functions h. Especially, for computable functions h : N −→ (0, 1)Q , we show that the class h-MC coincides with the classes of computable and semi-computable real numbers if and only if ∑ i∈N(1− h(i)) = ∞ and the sum ∑ i∈N(1− h(i)) is a computable real number, respectively. On the other hand, if h(n) ≥ 1 and h converges to 1, then h-MC = SC (the class of semi-computable reals) no matter how fast h converges to 1. Furthermore, for any constant c > 1, if h is increasing and converges to c, then h-MC = c-MC . Finally, if h is monotone and unbounded, then h-MC contains all ω-mc real numbers which are g-mc for some computable function g.

[1]  Burchard von Braunmühl,et al.  Monotonically Computable Real Numbers , 2002, Math. Log. Q..

[2]  Marian Boykan Pour-El,et al.  Review: Robert I. Soare, Recursively enumerable sets and degrees: A study of computable functions and computably generated sets , 1988 .

[3]  Burchard von Braunmühl,et al.  Weakly Computable Real Numbers and Total Computable Real Functions , 2001, COCOON.

[4]  A. Turing On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[5]  John R. Myhill,et al.  Criteria of constructibility for real numbers , 1953, Journal of Symbolic Logic.

[6]  H. G. Rice,et al.  Recursive real numbers , 1954 .

[7]  R. Soare Recursively enumerable sets and degrees , 1987 .

[8]  Xizhong Zheng,et al.  On the hierarchy and extension of monotonically computable real numbers , 2003, J. Complex..

[9]  Rodney G. Downey Some Computability-Theoretical Aspects of Reals and Randomness , 2002 .

[10]  Dana,et al.  JSL volume 88 issue 4 Cover and Front matter , 1983, The Journal of Symbolic Logic.

[11]  Cristian S. Calude A characterization of c.e. random reals , 2002, Theor. Comput. Sci..

[12]  Kenneth W. Regan,et al.  Computability , 2022, Algorithms and Theory of Computation Handbook.

[13]  Ernst Specker,et al.  Nicht konstruktiv beweisbare Sätze der Analysis , 1949, Journal of Symbolic Logic.

[14]  Klaus Weihrauch,et al.  Weakly Computable Real Numbers , 2000, J. Complex..

[15]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[16]  Xizhong Zheng Recursive Approximability of Real Numbers , 2002, Math. Log. Q..

[17]  Cristian S. Calude,et al.  Computable Approximations of Reals: An Information-Theoretic Analysis , 1998, Fundam. Informaticae.