{"language":[{"iso":"eng"}],"page":"392-404","publication":"Computability and Complexity in Analysis","_id":"18260","status":"public","year":"2004","user_id":"15415","type":"conference","citation":{"ama":"Ziegler M. Computable operators on regular sets. In: <i>Computability and Complexity in Analysis</i>. Vol 50. ; 2004:392-404. doi:<a href=\"https://doi.org/10.1002/malq.200310107\">10.1002/malq.200310107</a>","bibtex":"@inproceedings{Ziegler_2004, title={Computable operators on regular sets}, volume={50}, DOI={<a href=\"https://doi.org/10.1002/malq.200310107\">10.1002/malq.200310107</a>}, number={4–5}, booktitle={Computability and Complexity in Analysis}, author={Ziegler, Martin}, year={2004}, pages={392–404} }","ieee":"M. Ziegler, “Computable operators on regular sets,” in <i>Computability and Complexity in Analysis</i>, 2004, vol. 50, no. 4–5, pp. 392–404, doi: <a href=\"https://doi.org/10.1002/malq.200310107\">10.1002/malq.200310107</a>.","short":"M. Ziegler, in: Computability and Complexity in Analysis, 2004, pp. 392–404.","apa":"Ziegler, M. (2004). Computable operators on regular sets. <i>Computability and Complexity in Analysis</i>, <i>50</i>(4–5), 392–404. <a href=\"https://doi.org/10.1002/malq.200310107\">https://doi.org/10.1002/malq.200310107</a>","mla":"Ziegler, Martin. “Computable Operators on Regular Sets.” <i>Computability and Complexity in Analysis</i>, vol. 50, no. 4–5, 2004, pp. 392–404, doi:<a href=\"https://doi.org/10.1002/malq.200310107\">10.1002/malq.200310107</a>.","chicago":"Ziegler, Martin. “Computable Operators on Regular Sets.” In <i>Computability and Complexity in Analysis</i>, 50:392–404, 2004. <a href=\"https://doi.org/10.1002/malq.200310107\">https://doi.org/10.1002/malq.200310107</a>."},"intvolume":"        50","issue":"4-5","date_updated":"2022-01-06T06:53:28Z","title":"Computable operators on regular sets","abstract":[{"text":"For uniform computability of regular sets in Euclidean space, previous work has identified twelve 'basic' notions, to (pairs of) which many previous notions considered in literature were shown to be equivalent.\r\n\r\nWith respect to those basic notions, we now investigate on the computability of natural OPERATIONS on regular sets: union, intersection, complement, convex hull, image, and pre-image under suitable classes of functions.","lang":"eng"}],"date_created":"2020-08-25T10:31:45Z","doi":"10.1002/malq.200310107","publication_status":"published","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"publication_identifier":{"issn":["0942-5616","1521-3870"]},"volume":50,"department":[{"_id":"63"}]}