Weakly Computable Real Numbers and Total Computable Real Functions
暂无分享,去创建一个
[1] Klaus Weihrauch,et al. A Finite Hierarchy of the Recursively Enumerable Real Numbers , 1998, MFCS.
[2] A. Grzegorczyk. On the definitions of computable real continuous functions , 1957 .
[3] Xizhong Zheng. Closure Properties of Real Number Classes under Limits and Computable Operators , 2000, COCOON.
[4] Raphael M. Robinson,et al. Review: Rozsa Peter, Rekursive Funktionen , 1951 .
[5] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[6] Klaus Weihrauch,et al. Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.
[7] Fred C. Hennie,et al. Introduction to Computability , 1977 .
[8] Ernst Specker,et al. Nicht konstruktiv beweisbare Sätze der Analysis , 1949, Journal of Symbolic Logic.
[9] Klaus Weihrauch,et al. Weakly Computable Real Numbers , 2000, J. Complex..
[10] Cristian S. Calude,et al. Recursively Enumerable Reals and Chaitin Omega Numbers , 1998, STACS.
[11] Ker-I Ko,et al. Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.
[12] Xizhong Zheng. The closure properties on real numbers under limits and computable operators , 2002, Theor. Comput. Sci..
[13] Marian Boykan Pour-El,et al. Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.