{"user_id":"15415","year":"2008","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"},{"first_name":"Wouter M.","full_name":"Koolen, Wouter M.","last_name":"Koolen"}],"status":"public","_id":"26235","date_created":"2021-10-15T09:34:19Z","department":[{"_id":"63"}],"citation":{"apa":"Ziegler, M., &#38; Koolen, W. M. (2008). Kolmogorov Complexity Theory over the Reals. In <i>arXiv:0802.2027</i>.","mla":"Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over the Reals.” <i>ArXiv:0802.2027</i>, 2008.","chicago":"Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over the Reals.” <i>ArXiv:0802.2027</i>, 2008.","ama":"Ziegler M, Koolen WM. Kolmogorov Complexity Theory over the Reals. <i>arXiv:08022027</i>. Published online 2008.","bibtex":"@article{Ziegler_Koolen_2008, title={Kolmogorov Complexity Theory over the Reals}, journal={arXiv:0802.2027}, author={Ziegler, Martin and Koolen, Wouter M.}, year={2008} }","ieee":"M. Ziegler and W. M. Koolen, “Kolmogorov Complexity Theory over the Reals,” <i>arXiv:0802.2027</i>. 2008.","short":"M. Ziegler, W.M. Koolen, ArXiv:0802.2027 (2008)."},"type":"preprint","date_updated":"2022-01-06T06:57:18Z","language":[{"iso":"eng"}],"abstract":[{"text":"Kolmogorov Complexity constitutes an integral part of computability theory,\r\ninformation theory, and computational complexity theory -- in the discrete\r\nsetting of bits and Turing machines. Over real numbers, on the other hand, the\r\nBSS-machine (aka real-RAM) has been established as a major model of\r\ncomputation. This real realm has turned out to exhibit natural counterparts to\r\nmany notions and results in classical complexity and recursion theory; although\r\nusually with considerably different proofs. The present work investigates\r\nsimilarities and differences between discrete and real Kolmogorov Complexity as\r\nintroduced by Montana and Pardo (1998).","lang":"eng"}],"publication":"arXiv:0802.2027","title":"Kolmogorov Complexity Theory over the Reals"}