Concrete models of computation for topological algebras

Theoretical Computer Science

Volumn 219, Issue 1-2, 1999, Pages 347-378

  Stoltenberg Hansen, Viggo ^a   Tucker, John V ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000234877     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00296-5     Document Type: Article

References (35)

1. S. Abramsky, A. Jung, Domain theory, in: S. Abramsky, D. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. III, Oxford University Press, Oxford, 1994, pp. 1-168.
2. U. Berger, Total sets and objects in domain theory, Ann. Pure Appl. Logic 60 (1993) 91-117.
3. J. Blanck, Domain representability of metric spaces, U.U.D.M. Report, 1995: 20.
4. J. Blanck, Computability on topological spaces by effective domain representations, Uppsala Dissertations in Mathematics, vol. 7, 1997.
5. J. Blanck, Domain representability of metric spaces, Ann. Pure Appl. Logic 83 (1997) 225-247.
6. L. Blum, M. Shub, S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions, and universal machines, Bull. Amer. Math. Soc. 21 (1989) 1-46.
7. V. Brattka, Recursive characterisation of computable real valued functions and relations, Theoret. Comput. Sci. 162 (1996) 45-77.
8. C.S. Ceitin, Algorithmic operators in constructive complete separable metric spaces, Doklady Akademii Nauk SSSR 128 (1959) 49-52.
9. A. Edalat, Dynamical systems, measures, and fractals via domain theory, Inform. Comput. 120 (1995) 32-48.
10. A. Edalat, Domain theory and integration, Theoret. Comput. Sci. 151 (1995) 163-193.
11. Yu.L. Ershov, Model C of partial continuous functionals, in: R.O. Gandy, J.M.E. Hyland (Eds.), Logic Colloquium 76, North-Holland, Amsterdam, 1977, pp. 455-467.
12. A. Grzegorczyk, Computable functionals, Fund. Math. 42 (1955) 168-202.
13. A. Grzegorczyk, On the definitions of computable real continuous functions, Fund. Math. 44 (1957) 61-71.
14. C. Kreitz, K. Weihrauch, Theory of representations, Theoret. Comput. Sci. 38 (1985) 35-53.
15. A.H. Lachlan, E.W. Madison, Computable fields and arithmetically definable ordered fields, Proc. Amer. Math. Soc. 24 (1970) 803-807.
16. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I, II, III, C.R. Acad. Sci. Sér. A 240 (1955) 2478-2480, and 241 (1955) 13- 14, 151-153.
17. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I, II, III, C.R. Acad. Sci. Sér. A 240 (1955) 2478-2480, and 241 (1955) 13- 14, 151-153.
18. E.W. Madison, A note on computable real fields, J. Symbolic Logic 35 (1970) 239-241.
19. Y.N. Moschovakis, Recursive metric spaces, Fund. Math. 55 (1964) 215-238.
20. D. Normann, A hierarchy of domains with totality but without density, in: S.B. Cooper et al. (Eds.), Computability, Enumerability, Unsolvability. Directions in Recursion Theory, Cambridge University Press, Cambridge, 1996.
21. E. Palmgren, V. Stoltenberg-Hansen, Domain interpretations of Martin-Löf's partial type theory, Ann. Pure Appl. Logic 48 (1990) 135-196.
22. M.B. Pour-El, J.I. Richards, Computability and noncomputability in classical analysis, Trans. Amer. Math. Soc. 275 (1983) 539-560.
23. M.B. Pour-El, J.I. Richards, Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer, Berlin, 1989.
24. V. Stoltenberg-Hansen, I. Lindström, E.R. Griffor, Mathematical Theory of Domains, Cambridge Tracts in Theoretical Computer Science, vol. 22, Cambridge University Press, Cambridge, 1994.
25. V. Stoltenberg-Hansen, J.V. Tucker, Complete local rings as domains, Centre for Theoretical Computer Science Reports, University of Leeds, Report 1.85, Leeds, 1985.
26. V. Stoltenberg-Hansen, J.V. Tucker, Complete local rings as domains, J. Symbolic Logic 53 (1988) 603-624.
27. V. Stoltenberg-Hansen, J.V. Tucker, Algebraic equations and fixed-point equations in inverse limits, Theoret. Comput. Sci. 87 (1991) 1-24.
28. V. Stoltenberg-Hansen, J.V. Tucker, Infinite systems of equations over inverse limits and infinite synchronous concurrent algorithms, in: J.W. de Bakker, G. Rozenberg, W.P. de Roever (Eds.), Semantics - Foundations and Applications, Lecture Notes in Computer Science, vol. 666, Springer, Berlin, 1993, pp. 531-562.
29. V. Stoltenberg-Hansen, J.V. Tucker, Effective algebras, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. IV: Semantic Modelling, Oxford University Press, Oxford, 1995, pp. 357-526.
30. J.V. Tucker, J. Zucker, Program Correctness over Abstract Data Types with Error-State Semantics, North-Holland, Amsterdam, 1988.
31. J.V. Tucker, J. Zucker, Computable functions and semicomputable sets on many-sorted algebras, in: S. Abramsky, D. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. V, Oxford University Press, Oxford, to appear.
32. J.V. Tucker, J. Zucker, Computation by "While" programs on topological partial algebras, Theoret. Comput. Sci., this issue.
33. G. Waagbø, Denotational semantics for intuitionistic type theory using a hiearchy of domains with totality, Ph.D. Thesis, Oslo, 1997.
34. K. Weihrauch, Computability, EATCS Monographs on Theoretical Computer Science, vol. 9, Springer, Berlin, 1987.
35. K. Weihrauch, U. Schreiber, Embedding metric spaces into cpo's, Theoret. Comput. Sci. 16 (1981) 5-24.