Extended admissibility

Theoretical Computer Science - Tập 284 - Trang 519-538 - 2002
Matthias Schröder1
1FernUniversität Hagen, Theoretische Informatik I, D-58084 Hagen, Germany

Tài liệu tham khảo

Engelking, 1989 Grzegorcyzk, 1957, On the definitions of computable real continuous functions, Fund. Math., 44, 61, 10.4064/fm-44-1-61-71 Ko, 1991 Kreitz, 1985, Theory of representations, Theoret. Comput. Sci., 38, 35, 10.1016/0304-3975(85)90208-7 Pour-El, 1989 Stoltenberg-Hansen, 1999, Concrete models of computation for topological algebras, Theoret. Comput. Sci., 219, 347, 10.1016/S0304-3975(98)00296-5 Weihrauch, 1987 Weihrauch, 1995, A foundation for computable analysis, EATCS Bull., 57, 167 K. Weihrauch, A foundation for computable analysis, in: Proc. DMTCS ’96, Discrete Mathematics and Theoretical Computer Science, Springer, Berlin, 1997, pp. 66–89. Weihrauch, 2000