Computable total functions on metric algebras, universal algebraic specifications and dynamical systems

Journal of Logic and Algebraic Programming

Volumn 62, Issue 1, 2005, Pages 71-108

  Tucker, J V ^a   Zucker, J I ^b  

^a SWANSEA UNIVERSITY   (United Kingdom)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Computable approximations; Computable function; Conditional equations; Countable choice; Many sorted algebra; Metric algebra; Topological algebra; Uniform continuity; While programs

Indexed keywords

APPROXIMATION THEORY; DATA STRUCTURES; FUNCTIONS; SPECIFICATIONS; THEOREM PROVING; TOPOLOGY;

COMPUTABLE APPROXIMATIONS; COMPUTABLE FUNCTIONS; CONDITIONAL EQUATIONS; COUNTABLE CHOICES; MANY SORTED ALGEBRA; MERTIC ALGEBRA; TOPOLOGICAL ALGEBRA; UNIFORM CONTINUITY; WHILE PROGRAMS;

ALGEBRA;

EID: 10044238010     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2003.10.001     Document Type: Article

References (58)

1. V.I. Arnold, Ordinary Differential Equations, MIT Press, 1973.
2. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation, Springer-Verlag, 1998.
3. V. Brattka, Recursive characterisation of computable real-valued functions and relations, Theoretical Computer Science 162 (1996) 45-77.
4. V. Brattka, Recursive and computable operations over topological structures, Ph.D. Thesis, FernUniversität Hagen, Fachbereich Informatik, Hagen, Germany, 1999, Informatik Berichte 255, FernUniversität Hagen, July 1999.
5. J.A. Bergstra, J.V. Tucker, Initial and final algebra semantics for data type specifications: two characterization theorems, SIAM Journal of Computing 12 (1983) 366-387.
6. J.A. Bergstra, J.V. Tucker, Algebraic specifications of computable and semicomputable data types. Theoretical Computer Science 50 (1987) 137-181.
7. J.A. Bergstra, J.V. Tucker, Equational specifications, complete term rewriting and computable and semicomputable algebras, Journal of the Association for Computing Machinery 42 (1995) 1194-1230.
8. J.W. de Bakker, E. de Vink, Control Flow Semantics, The MIT Press, 1999.
9. J.W. de Bakker, J.J.M.M. Rutten (Eds.), Ten Years of Concurrency Semantics, World Scientific, 1992.
10. J.W. de Bakker, J.I. Zucker, Processes and the denotational semantics of concurrency, Information and Control 54 (1982) 70-120, Reprinted, with errata, in [9].
11. N. Dershowitz, Rewrite, rewrite, rewrite, rewrite, rewrite, ..., Theoretical Computer Science 83 (1991) 71-96.
12. A. Edalat, Domains for computation in mathematics, physics and exact real arithmetic, Bulletin of Symbolic Logic 3 (1997) 401-452.
13. E. Engeler, Algorithmic Properties of Structures, World Scientific Publishing Co., 1993.
14. A. Grzegorczyk, Computable functions, Fundamenta Mathematicae 42 (1955) 168-202.
15. A. Grzegorczyk, On the definitions of computable real continuous functions, Fundamenta Mathematicae 44 (1957) 61-71.
16. J.A. Goguen, J.W. Thatcher, E.G. Wagner, J.B. Wright, Initial algebra semantics and continuous algebras, Journal of the Association for Computing Machinery 24 (1977) 68-95.
17. I. Guessarian, Algebraic Semantics, Lecture Notes in Computer Science, vol. 99, Springer-Verlag, 1981.
18. M. Haveraaen, Case study on algebraic software methodologies for scientific computing, Scientific Programming 8 (2000) 261-273.
19. A.V. Holden, M. Poole, J.V. Tucker, H. Zhang, Coupled map lattices as computational systems, Chaos 2 (1992) 367-376.
20. N.A. Harman, J.V. Tucker, Algebraic models of microprocessors: architecture and organisation, Acta Informatica 33 (1996) 421-456.
21. K.M. Hobley, B.C. Thompson, J.V. Tucker, Specification and verification of synchronous concurrent algorithms: a case study of a convoluted algorithm, in: G. Milne (Ed.), The Fusion of Hardware Design and Verification (Proceedings of IFIP Working Group 10.2 Working Conference), North Holland, 1988, pp. 347-374.
22. B.M. Khoussainov, Randomness, computability, and algebraic specifications, Annals of Pure & Applied Logic 91 (1) (1998) 1-15.
23. J.R. Kennaway, J.W. Klop, M.R. Sleep, F.J. de Vries, Transfinite reductions in orthogonal term rewriting systems, Information and Computation 119 (1995) 18-38.
24. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles, I, II, III, Comptes Rendus De L Academie Des Sciences, Paris 240 (1955) 2470-2480, 241:13-14, 151-153.
25. K. Meinke, Universal algebra in higher types, Theoretical Computer Science 100 (1992) 385-417.
26. K. Meinke, Topological methods for algebraic specification, Theoretical Computer Science 166 (1996) 263-290.
27. J. Meseguer, J.A. Goguen, Initiality, induction and computability, in: M. Nivat, J. Reynolds (Eds.), Algebraic Methods in Semantics, Cambridge University Press, 1985, pp. 459-541.
28. T.S.E. Maibaum, C.J. Lucena, Higher-order data types, International Journal of Computing and Information Science 9 (1980) 31-53.
29. J. Meseguer, L. Moss, J.A. Goguen, Final algebra, cosemicomputable algebras, and degrees of unsolvability, Theoretical Computer Science 100 (1992) 267-302.
30. B. Möller, On the algebraic specification of infinite objects - ordered and continuous models of algebraic types, Acta Informatica 22 (1985) 537-578.
31. B. Möller, Higher-order algebraic specifications, Habilitationsschrift, Technische Universität München, 1987.
32. Y.N. Moschovakis, Recursive metric spaces, Fundamenta Mathematicae 55 (1964) 215-238.
33. K. Meinke, J. Steggles, Specification and verification in higher order algebra: a case study of convolution, in: J. Heering, K. Meinke, B. Möller, T. Nipkow (Eds.), Higher Order Algebra, Logic and Term Rewriting, Lecture Notes in Computer Science, vol. 816, Springer-Verlag, 1994, pp. 189-222.
34. M.B. Pour-El, J.C. Caldwell, On a simple definition of computable function of a real variable with applications to functions of a complex variable, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 21 (1975) 1-19.
35. M.B. Pour-El, J.I. Richards, Computability in Analysis and Physics, Springer-Verlag, 1989.
36. M.J. Poole, J.V. Tucker, A.V. Holden, Hierarchies of spatially extended systems and synchronous concurrent algorithms, in: B. Möller, J.V. Tucker (Eds.), Prospects for Hardware Foundations, Lecture Notes in Computer Science, vol. 1546, Springer-Verlag, 1998, pp. 184-235.
37. M.J. Poole, J.V. Tucker, A.V. Holden, Hierarchical reconstructions of cardiac tissue, Chaos, Solitons and Fractals 13 (2002) 1581-1612.
38. M. Roggenbach, L. Schröder, T. Mossakowski, Specifying real numbers in CASL, in: C. Choppy, D. Bert, P. Mosses (Eds.), Recent Developments in Algebraic Development Techniques. 14th International Workshop, WADT'99, Chateau de Bonas, France, Lecture Notes in Computer Science, vol. 1827, Springer-Verlag, 2000, pp. 146-161.
39. W. Rudin, Principles of Mathematical Analysis, third ed., McGraw-Hill, 1976.
40. J.C. Shepherdson, On the definition of computable function of a real variable, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 22 (1976) 391-402.
41. V. Stoltenberg-Hansen, J.V. Tucker, Complete local rings as domains, Journal of Symbolic Logic 53 (1988) 603-624.
42. V. Stoltenberg-Hansen, J.V. Tucker, Effective algebras, in: S. Abramsky, D. Gabbay, T. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 4, Oxford University Press, 1995, pp. 357-526.
43. V. Stoltenberg-Hansen, J.V. Tucker, Concrete models of computation for topological algebras, Theoretical Computer Science 219 (1999) 347-378.
44. V. Stoltenberg-Hansen, J.V. Tucker, Computable and continuous homomorphisms on metric partial algebras, Bulletin of Symbolic Logic 9 (2003) 299-334.
45. D. Spreen, On effective topological spaces, Journal of Symbolic Logic 63 (1998) 185-221.
46. D. Spreen, Representations versus numberings: on the relationship of two computability notions, Theoretical Computer Science 263 (2001) 473-499.
47. K. Stewart, Concrete and abstract models of computation over metric algebras, Ph.D. Thesis, Department of Computer Science, University of Wales, Swansea, 1998.
48. B.C. Thompson, J.V. Tucker, Algebraic specification of synchronous concurrent algorithms and architectures. Research Report CSR 9-91, Department of Computer Science, University College of Swansea, 1994 (second ed.).
49. J.V. Tucker, J.I. Zucker, Program Correctness over Abstract Data Types, with Error-State Semantics, CWI Monographs, vol. 6, North Holland, 1988.
50. J.V. Tucker, J.I. Zucker, Examples of semicomputable sets of real and complex numbers, in: J.P. Myers Jr., M.J. O'Donnell (Eds.), Constructivity in Computer Science: Summer Symposium, San Antonio, Texas, June 1991, Lecture Notes in Computer Science, vol. 613, Springer-Verlag, 1992, pp. 179-198.
51. J.V. Tucker, J.I. Zucker, Computation by 'while' programs on topological partial algebras, Theoretical Computer Science 219 (1999) 379-420.
52. J.V. Tucker, J.I. Zucker, Computable functions and semicomputable sets on many-sorted algebras, in: S. Abramsky, D. Gabbay, T. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 5, Oxford University Press, 2000, pp. 317-523.
53. J.V. Tucker, J.I. Zucker, Abstract computability and algebraic specification, ACM Transactions on Computational Logic 3 (2002) 279-333.
54. J.V. Tucker, J.I. Zucker, Infinitary initial algebra specifications for stream algebras, in: W. Sieg, R. Sommer, C. Talcott (Eds.), Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman, Lecture Notes in Logic, vol. 15, Association for Symbolic Logic, 2002, pp. 234-256.
55. J.V. Tucker, J.I. Zucker, Abstract versus concrete computation on metric partial algebras, ACM Transactions on Computational Logic, in press.
56. A. van Wijngaarden, Numerical analysis as an independent science, BIT 6 (1966) 68-81.
57. K. Weihrauch, Computable Analysis: An Introduction, Springer-Verlag, 2000.
58. H. Whitney, Differentiable manifolds, Annals of Mathematics 37 (1935) 645-680.