Examples of semicomputable sets of real and complex numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 613 LNCS, Issue , 1992, Pages 179-198

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

^a SWANSEA UNIVERSITY   (United Kingdom)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ABSTRACT STRUCTURES; ALL-REDUCE; COMPLEX NUMBER; NATURAL NUMBER;

ARTIFICIAL INTELLIGENCE;

EID: 77956705762     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0021091     Document Type: Conference Paper

References (20)

1. E. Becker (1986), On the real spectrum of a ring and its application to semialgebraic geometry, Bull. Amer. Math. Soc. (N.S.) 15, 19-60.
2. L. Blum, M. Shub and S. Smale (1989), On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. (N.S.) 21, 1-46.
3. T. Bröcker and L.C. Lander (1975), Differentiable Germs and Catastrophes, London Math. Soc.
4. E. Engeler (1968), Formal Languages: Automata and Structures, Markham Publ. Co.
5. E. Engeler (1975), On the solvability of algorithmic problems, Logic Colloquium '73 (H.E. Rose and J.C. Shepherdson, eds.), North-Holland, pp. 231-251.
6. H. Friedman (1971), Algorithmic procedures, generalised Turing algorithms and elememtary recursion theories, Logic Colloquium '69 (R.O. Gandy and C.M.E. Yates, eds.), North-Holland, pp. 361-389.
7. G.T. Herman and S.D. Isard (1970), Computability over arbitrary fields, J. London Math. Soc. (2) 2, 73-79.
8. S.C. Kleene (1952), Introduction to Metamathematics, North-Holland.
9. A. Kreczmar (1977), Programmability in fields, Fundamenta Informaticae 1, 195-230.
10. G. Kreisel and J.L. Krivine (1971), Elements of Mathematical Logic, North-Holland.
11. I. R. Shafarevich (1977), Basic Algebraic Geometry (transl. K.A. Hirsch), Springer-Verlag.
12. J. Shepherdson (1985), Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory, Harvey Friedman’s Research on the Foundations of Mathematics (L.A. Harrington, M.D. Morley, A. Ščedrov and S.G. Simpson, eds.), North-Holland, pp. 309-315.
13. A.S. Troelstra and D. van Dalen (1988), Constructivism in Mathematics: An Introduction, Vol. I, North-Holland.
14. J.V. Tucker (1980), Computing in algebraic systems, Recursion Theory, Its Generalisations and Applications (F.R. Drake and S.S. Wainer, eds.), LMS/Cambridge University Press.
15. J. V. Tucker, S.S. Wainer and J. I. Zucker (1990), Provable computable functions on abstract data types, Proceedings of the 17th International Colloquium on Automata, Languages and Programming, Warwick University, England, July 1990 (M.S. Paterson, ed.), Lecture Notes in Computer Science 443, Springer-Verlag, pp. 745-760.
16. J.V. Tucker and J.I. Zucker (1988), Program Correctness over Abstract Data Types, with Error-State Semantics, CWI Monograph Series, North-Holland and the Centre for Mathematics and Computer Science (CWI), Amsterdam.
17. J.V. Tucker and J.I. Zucker (1989), Horn programs and semicomputdble relations on abstract structures, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, Stresa, Italy, July 1989, Lecture Notes in Computer Science 372, Springer-Verlag, pp. 745-760.
18. J.V. Tucker and J.I. Zucker (1991a), Provable computable selection functions on abstract structures, Leeds Proof Theory 1990 (P. Aczel, H. Simmons and S.S. Wainer, eds.), Cambridge University Press (to appear).
19. J.V. Tucker and J.I. Zucker (1991b), Deterministic and nondeterministic computation, and Horn programs, on abstract data structures, J. Logic Programming (to appear).
20. J.V. Tucker and J.I. Zucker (1991c), Specifications, relations and selection functions on abstract data types, Department of Computer Science & Systems, McMaster University, Technical Report 91-14.