Computable operators on regular sets

M. Ziegler, in: Computability and Complexity in Analysis, 2003, pp. 389–406.

Download
No fulltext has been uploaded.
Conference Paper | Published | English
Author
Abstract
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.<br>With 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.
Publishing Year
Proceedings Title
Computability and Complexity in Analysis
Issue
302-8/2003
Page
389-406
LibreCat-ID

Cite this

Ziegler M. Computable operators on regular sets. In: Computability and Complexity in Analysis. ; 2003:389-406. doi:10.1002/malq.200310107
Ziegler, M. (2003). Computable operators on regular sets. In Computability and Complexity in Analysis (pp. 389–406). https://doi.org/10.1002/malq.200310107
@inproceedings{Ziegler_2003, title={Computable operators on regular sets}, DOI={10.1002/malq.200310107}, number={302–8/2003}, booktitle={Computability and Complexity in Analysis}, author={Ziegler, Martin}, year={2003}, pages={389–406} }
Ziegler, Martin. “Computable Operators on Regular Sets.” In Computability and Complexity in Analysis, 389–406, 2003. https://doi.org/10.1002/malq.200310107.
M. Ziegler, “Computable operators on regular sets,” in Computability and Complexity in Analysis, 2003, no. 302–8/2003, pp. 389–406.
Ziegler, Martin. “Computable Operators on Regular Sets.” Computability and Complexity in Analysis, no. 302-8/2003, 2003, pp. 389–406, doi:10.1002/malq.200310107.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar