Computable operators on regular sets

Mathematical Logic Quarterly

Volumn 50, Issue 4-5, 2004, Pages 392-404

  Ziegler, Martin ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Computability; Recursive analysis; Regular set; Set operators

Indexed keywords

EID: 10844219939     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.200310107     Document Type: Article

References (15)

1. V. Brattka, Computable invariance. Theoretical Computer Science 210, 3-20 (1999).
2. V. Brattka and K. Weihrauch, Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science 219, 65-93 (1999).
3. A. Edalat and A. Lieutier, Foundation of a computable solid modelling. Theoretical Computer Science 284, 319-345 (2002).
4. X. Ge and A. Nerode, On extreme points of convex compact Turing located sets. In: Logical Foundations of Computer Science; Springer Lecture Notes in Computer Science 813, 114-128 (1994).
5. B. Grünbaum, Convex Polytopes (Wiley & Sons, New York 1967).
6. P. Hertling, An effective Riemann mapping theorem. Theoretical Computer Science 219, 225-265 (1999).
7. P. Hertling, A comparison of certain representations of regularly closed sets. Elsevier ENTCS 66(1) (2002).
8. M. Kummer, and M. Schäfer, Computability of convex sets. Springer Lecture Notes in Computer Science 900, 550-561 (1995).
9. K. Kuratowski, Topology, Vol. I (Academic Press, New York 1966).
10. W. Thomas, Automata on infinite objects. In: Handbook of Theoretical Computer Science, Vol. B (Formal Models and Semantics), pp. 133-191 (Elsevier 1990).
11. A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42, 230-265 (1936).
12. K. Weihrauch, Computable Analysis (Springer-Verlag, Berlin 2000).
13. M. Ziegler, Computability on regular subsets of Euclidean space. Math. Logic Quarterly 48, Supplement 1, 157-181 (2002).
14. M. Ziegler and V. Brattka, Computing the dimension of linear subspaces. In: Proc. 29th SOFSEM; Springer Lecture Notes in Computer Science 1963, 450-458 (2000).
15. M. Ziegler and V. Brattka, Turing Computability of (non-)linear optimization. In: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG'2001), pp. 181-184.