A natural weak limit space with admissible representation which is not a limit space

Electronic Notes in Theoretical Computer Science

Volumn 66, Issue , 2002, Pages 165-175

  Schröder, Matthias ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONFORMAL MAPPING; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; SET THEORY; TOPOLOGY;

CLOSED SETS; EUCLIDEAN TOPOLOGY; TWO THEORY EFFECTIVITY (TTE);

COMPUTATIONAL METHODS;

EID: 18944381334     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80387-6     Document Type: Conference Paper

References (21)

1. Beer G. Topologies on Closed and Closed Convex Sets. Mathematics and Its Applications. vol. 268:1993;Kluwer Academic, Dordrecht
2. Brattka V., Weihrauch K. Computability on Subsets of the Euclidean Space I: Closed and Compact Subsets. Theoretical Computer Science. 219:1999;65-93
3. V. Brattka, G. Presser: Computability on Subsets of Metric Spaces: Closed and Compact Subsets, accepted for publication in Theoretical Computer Science.
4. Dudley R.M. On Sequential Convergence. Transactions of the American Mathematical Society. 112:1964;483-507
5. Engelking R. General Topology. 1989;Heldermann, Berlin
6. Franklin S.P. Spaces in which sequences suffice. Fundamenta Mathematicae. 57:1965;107-115
7. Grzegorczyk A. On the definitions of computable real continuous functions. Fundamenta Mathematicae. 44:1957;61-71
8. Hyland J.M.E. Filter Spaces and Continuous Functionals. Annals of Mathematical Logic. 16:1979;101-143
9. Ker-I Ko. Complexity Theory of Real Functions. 1991;Birkhäuser, Boston
10. Kreitz C., Weihrauch K. Theory of representations. Theoretical Computer Science. 38:1985;35-53
11. M. Menni and A. Simpson: Topological and Limit-space Subcategories of Countably-based Equilogical Spaces, to appear in Math. Struct. in Comp. Sci., vol. 12 (2002). Available at http://www.dcs.ed.ac.uk/home/als.
12. Pour-El M., Richards J. Computability in Analysis and Physics. 1989;Springer, Berlin
13. M. Schröder: Extended Admissibility, accepted for publication in Theoretical Computer Science.
14. M. Schröder: Admissible Representations of Limit Spaces, Computability and Complexity in analysis, vol. 2064 of Lecture Notes in Computer Science (Springer, Berlin 2001), pp. 273-295.
15. M. Schröder: Effectivity in Spaces with Admissible Multirepresentations, accepted for publication in Mathematical Logic Quarterly (2002).
16. Smyth M.B. Topology. Handbook of Logic in Computer Science. vol. 1:1992;641-761 Oxford science publications
17. Stoltenberg-Hansen V., Tucker J.V. Concrete models of computation for topological algebras. Theoretical Computer Science. 219:1999;347-378
18. Weihrauch K. Computability. 1987;Springer, Berlin
19. Weihrauch K. Computable Analysis. 2000;Springer, Berlin
20. Willard S. General Topology. 1970;Addison-Wesley Publishing Company, Reading, Massachusetts
21. M. Ziegler, V. Brattka: Turing Computability of (Non-) Linear Optimization, Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG 2001), pp. 181-184.