A Foundation for Computable Analysis
暂无分享,去创建一个
[1] Erich Novak,et al. The Real Number Model in Numerical Analysis , 1995, J. Complex..
[2] Martín Hötzel Escardó,et al. PCF Extended with Real Numbers , 1996, Theor. Comput. Sci..
[3] Peter Hertling,et al. Feasible Real Random Access Machines , 1996, J. Complex..
[4] Ramon E. Moore. Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.
[5] Christoph Kreitz,et al. Compactness in constructive analysis revisited , 1987, Ann. Pure Appl. Log..
[6] Anne Sjerp Troelstra,et al. Comparing the Theory of Representations and Constructive Mathematics , 1991, CSL.
[7] Klaus Weihrauch,et al. Type 2 Recursion Theory , 1985, Theor. Comput. Sci..
[8] Ker-I Ko,et al. Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.
[9] Oliver Aberth. Precise Numerical Analysis with Disk , 1988 .
[10] Richard P. Brent,et al. Fast Multiple-Precision Evaluation of Elementary Functions , 1976, JACM.
[11] E. Wiedmer,et al. Computing with Infinite Objects , 1980, Theor. Comput. Sci..
[12] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .
[13] Jens Blanck,et al. Domain Representability of Metric Spaces , 1997, Ann. Pure Appl. Log..
[14] H. Woxniakowski. Information-Based Complexity , 1988 .
[15] Andrzej Grzegorczyk. On the definition of computable functionals , 1955 .
[16] Oliver Aberth,et al. Computable analysis , 1980 .
[17] Peter Hertling,et al. Unstetigkeitsgrade von Funktionen in der effektiven Analysis , 1996 .
[18] Klaus Weihrauch,et al. A unified approach to constructive and recursive analysis , 1984 .
[19] Allan Borodin,et al. The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.
[20] A. Turing,et al. On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .
[21] Klaus Weihrauch,et al. Computability on the probability measures on the Borel sets of the unit interval , 1997, CCA.
[22] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[23] A. Grzegorczyk. On the definitions of computable real continuous functions , 1957 .
[24] Christoph Kreitz,et al. Theory of Representations , 1985, Theor. Comput. Sci..
[25] Matthias Schröder,et al. Fast Online Multiplication of Real Numbers , 1997, STACS.
[26] Abbas Edalat. Domain Theory and Integration , 1995, Theor. Comput. Sci..
[27] Pietro Di Gianantonio. Real Number Computability and Domain Theory , 1996, Inf. Comput..
[28] Jürgen Hauck. Konstruktive reelle funktionale und Operatoren , 1983, Math. Log. Q..
[29] Helmut Alt,et al. Multiplication is the easiest nontrivial arithmetic function , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[30] Klaus Weihrauch,et al. Embedding Metric Spaces Into CPO's , 1981, Theor. Comput. Sci..
[31] Marian Boykan Pour-El,et al. Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.
[32] Norbert Th. Müller,et al. Uniform Computational Complexity of Taylor Series , 1987, ICALP.
[33] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .