Computability theory of generalized functions

Journal of the ACM

Volumn 50, Issue 4, 2003, Pages 469-505

  Zhong, Ning ^a   Weihrauch, Klaus ^b,c  

^a UNIVERSITY OF CINCINNATI   (United States)

^b UNIVERSITY OF HAGEN   (Germany)

^c Theoretische Inforatik I   (Germany)

Author keywords

Computability on distributions; Computable analysis; Computable real functions

Indexed keywords

COMPUTABILITY ON DISTRIBUTIONS; COMPUTABLE ANALYSIS; COMPUTABLE REAL FUNCTIONS;

COMPUTER APPLICATIONS; COMPUTER SYSTEMS; FUNCTION EVALUATION; PARTIAL DIFFERENTIAL EQUATIONS; THEOREM PROVING;

COMPUTATION THEORY;

EID: 18944388615     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/792538.792542     Document Type: Article

References (21)

1. BARROS-NETO, J. 1973. An introduction to the theory of distributions. In Pure and Applied Mathematics, vol. 14. Marcel Dekker Inc., New York.
2. DUNFORD, N., AND SCHWARTZ, J. T. 1959. Linear Operators Part I: General Theory. J. Wiley, New York.
3. GRZEGORCZYK, A. 1955. Computable functionals. Fund. Math. 42, 168-202.
4. GRZEGORCZYK, A. 1957. On the definitions of computable real continuous functions. Fund. Math. 44, 61-71.
5. HOPCROFT, J. E., AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Pa.
6. KREITZ, C., AND WEIHRAUCH, K. 1985. Theory of representations. Theoret. Comput. Sci. 38, 35-53.
7. MYHILL, J. 1971. A recursive function defined on a compact interval and having a continuous derivative that is not recursive. Mich. Math. J. 18, 97-98.
8. NORMANN, D. 2002. Exact real number computations relative to hereditarily total functionals. Theoret. Comput. Sci. 284, 2, 437-453.
9. ODIFREDDI, P. 1989. Classical recursion theory. In Studies in Logic and the Foundations of Mathematics, vol. 125. North-Holland, Amsterdam, The Netherland.
10. RAUCH. J. 1997. Partial differential equations, In Graduate. Texts in Mathematics. 2nd ed. Springer, New York.
11. ROGERS, H. 1967. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York.
12. SCHWARTZ, L. 1966. Théorie des Distributions. Hermann, Paris, France. Nouvelle édition.
13. SCHRÖDER, M. 2001. Admissible representations of limit spaces. In Computability and Complexity in Analysis, Jens Blanck, Vasco Brattka, and Peter Hertling, Eds. Lecture Notes in Computer Science. (Berlin, Springer, Germany), New York.
14. TURING, A. M. 1936. On computable numbers, with an application to the "Entscheidungsproblem." Proc. London Math. Soc. 42, 2, 230-265.
15. WASHIHARA, M. 1999. Computability and tempered distributions. Math. Japon. 50, 1, 1-7.
16. WEIHRAUCH, K. 1987. Computability. In EATCS Monographs on Theoretical Computer Science. Springer, Berlin, Germany.
17. WEIHRAUCH, K. 1997. A foundation for computable analysis. In SOFSEM'97: Theory and Practice of Informatics, František Plášil and Keith G. Jeffery, Eds. Lecture Notes in Computer Science, vol. 1338. Springer-Verlag, Berlin, pp. 104-121.
18. WEIHRAUCH, K. 1999. Computability on the probability measures on the Borel sets of the unit interval. Theoret. Comput. Sci. 219, 421-437.
19. WEIHRAUCH, K. 2000. Computable Analysis. Springer-Verlag, Berlin, Germany.
20. WEIHRAUCH, K., AND ZHONG, N. 2002. Is wave propagation computable or can wave computers beat the Turing machine? Proc. London Math. Soc. 85, 2, 312-332.
21. ZHONG, N., AND WEIHRAUCH, K. 2000. Computability theory of generalized functions. Informatik Berichte 276, FernUniversität Hagen, Hagen. Sept.