[{"department":[{"tree":[{"_id":"7"},{"_id":"34"},{"_id":"44"},{"_id":"43"}],"_id":"63"}],"citation":{"short":"V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.","apa":"Brattka, V., & Ziegler, M. (2001). Turing Computability of (Non-)Linear Optimization. In *Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)* (pp. 181–184).","mla":"Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” *Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)*, 2001, pp. 181–84.","bibtex":"@inproceedings{Brattka_Ziegler_2001, title={Turing Computability of (Non-)Linear Optimization}, booktitle={Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)}, author={Brattka, Vasco and Ziegler, Martin}, year={2001}, pages={181–184} }","chicago":"Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” In *Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)*, 181–84, 2001.","ieee":"V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,” in *Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)*, 2001, pp. 181–184."},"user_id":"15415","page":"181-184","creator":{"login":"koala","id":"15415"},"date_created":"2020-08-24T11:33:12Z","type":"conference","status":"public","_version":2,"dini_type":"doc-type:conferenceObject","_id":"18168","abstract":[{"lang":"eng"}],"message":" #HNIID-1640","publication":"Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG'01)","uri_base":"https://ris.uni-paderborn.de","date_updated":"2020-08-24T11:37:35Z","dc":{"creator":["Brattka, Vasco","Ziegler, Martin"],"date":["2001"],"language":["eng"],"type":["info:eu-repo/semantics/conferenceObject","doc-type:conferenceObject","text"],"rights":["info:eu-repo/semantics/closedAccess"],"title":["Turing Computability of (Non-)Linear Optimization"],"description":["We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing rather than the RealRAM model. Asking for mere computability of a function's maximum over some closed domain, we show that the common presumptions 'full-dimensional' and `bounded' in fact cannot be omitted: The sound framework of Recursive Analysis enables us to rigorously prove this folkloristic observation! On the other hand, convexity of this domain may be weakened to connectedness, and even NON-linear functions turn out to be effectively optimizable."],"source":["Brattka V, Ziegler M. Turing Computability of (Non-)Linear Optimization. In: *Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)*. ; 2001:181-184."],"identifier":["https://ris.uni-paderborn.de/record/18168"]},"author":[{"first_name":"Vasco","last_name":"Brattka"},{"first_name":"Martin","last_name":"Ziegler"}],"language":[{}]}]