H-monotonically Computable Real Numbers
暂无分享,去创建一个
[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.