{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:54:55Z","timestamp":1725605695416},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642218743"},{"type":"electronic","value":"9783642218750"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21875-0_9","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T07:51:59Z","timestamp":1315468319000},"page":"81-91","source":"Crossref","is-referenced-by-count":1,"title":["On the Kolmogorov Complexity of Continuous Real Functions"],"prefix":"10.1007","author":[{"given":"Amin","family":"Farjudian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol.\u00a03, pp. 1\u2013168. Clarendon Press, Oxford, Oxford (1994)"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers; NP completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society (new series)\u00a021(1), 1\u201346 (1989)","journal-title":"Bulletin of the American Mathematical Society (new series)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/319838.319860","volume-title":"Proceedings of the 1986 ACM Conference on LISP and Functional Programming","author":"H.J. B\u00f6hm","year":"1986","unstructured":"B\u00f6hm, H.J., Cartwright, R., Riggle, M., O\u2019Donnell, M.J.: Exact real arithmetic: A case study in higher order programming. In: Proceedings of the 1986 ACM Conference on LISP and Functional Programming, pp. 162\u2013173. ACM, New York (1986); held at MIT, Cambridge, MA"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/S0022-0000(05)80073-X","volume":"49","author":"J. Cai","year":"1994","unstructured":"Cai, J., Hartmanis, J.: On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. Journal of Computer and System Sciences\u00a049(3), 605\u2013619 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR5","unstructured":"Duracz, J.A., Kon\u010dn\u00fd, M.: Polynomial function enclosures and floating point software verification. In: CFV 2008, Sydney, Australia (August 2008)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Edalat, A., Lieutier, A.: Domain theory and differential calculus (functions of one variable). In: Proceedings of 17th Annual IEEE Symposium on Logic in Computer Science (LICS 2002), Copenhagen, Denmark, pp. 277\u2013286 (2002)","DOI":"10.1109\/LICS.2002.1029836"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(98)00097-8","volume":"210","author":"A. Edalat","year":"1999","unstructured":"Edalat, A., S\u00fcnderhauf, P.: A domain theoretic approach to computability on the real line. Theoretical Computer Science\u00a0210, 73\u201398 (1999)","journal-title":"Theoretical Computer Science"},{"key":"9_CR8","unstructured":"Escard\u00f3, M.H.: PCF extended with real numbers: a domain theoretic approach to higher order exact real number computation. Ph.D. thesis, Imperial College (1997)"},{"key":"9_CR9","unstructured":"Farjudian, A.: On the Kolmogorov complexity of continuous real functions (2011), an extended abstract available at, \n                  \n                    http:\/\/www.cs.nott.ac.uk\/~avf\/AuxFiles\/2011-Farjudian-Kolmogorov-Real-Fun.pdf"},{"key":"9_CR10","volume-title":"Encycloedia of Mathematics and its Applications","author":"G. Gierz","year":"2003","unstructured":"Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M.W., Scott, D.S.: Continuous Lattices and Domains. In: Encycloedia of Mathematics and its Applications, vol.\u00a093, Cambridge University Press, Cambridge (2003)"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1090\/S0273-0979-1992-00328-2","volume":"27","author":"B.R. Hunt","year":"1992","unstructured":"Hunt, B.R., Sauer, T., Yorke, J.A.: Prevalence: A translation-invariant \u201calmost every\u201d on infinite-dimensional spaces. Bulletin of the American Mathematical Society\u00a027(2), 217\u2013238 (1992)","journal-title":"Bulletin of the American Mathematical Society"},{"issue":"18","key":"9_CR12","first-page":"2629","volume":"16","author":"M. Kone\u010dn\u00fd","year":"2010","unstructured":"Kone\u010dn\u00fd, M., Farjudian, A.: Compositional semantics of dataflow networks with query-driven communication of exact values. Journal of Universal Computer Science\u00a016(18), 2629\u20132656 (2010)","journal-title":"Journal of Universal Computer Science"},{"issue":"18","key":"9_CR13","first-page":"2597","volume":"16","author":"M. Kone\u010dn\u00fd","year":"2010","unstructured":"Kone\u010dn\u00fd, M., Farjudian, A.: Semantics of query-driven communication of exact values. Journal of Universal Computer Science\u00a016(18), 2597\u20132628 (2010)","journal-title":"Journal of Universal Computer Science"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1017\/S0960129506005822","volume":"17","author":"B. Lambov","year":"2007","unstructured":"Lambov, B.: Reallib: An efficient implementation of exact real arithmetic. Mathematical Structures in Computer Science\u00a017(1), 81\u201398 (2007)","journal-title":"Mathematical Structures in Computer Science"},{"key":"9_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Heidelberg (1997)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(98)00089-1","volume":"67","author":"J.L. Monta\u00f1a","year":"1998","unstructured":"Monta\u00f1a, J.L., Pardo, L.M.: On Kolmogorov complexity in the real Turing machine setting. Information Processing Letters\u00a067, 81\u201386 (1998)","journal-title":"Information Processing Letters"},{"key":"9_CR17","volume-title":"Interval Analysis","author":"R.E. Moore","year":"1966","unstructured":"Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45335-0_14","volume-title":"Computability and Complexity in Analysis","author":"N.T.. M\u00fcller","year":"2001","unstructured":"M\u00fcller, N.T.: The iRRAM: Exact arithmetic in C++. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol.\u00a02064, pp. 222\u2013252. Springer, Heidelberg (2001)"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1023061927787","volume":"9","author":"A. Neumaier","year":"2003","unstructured":"Neumaier, A.: Taylor forms - use and limits. Reliable Computing\u00a09(1), 43\u201379 (2003)","journal-title":"Reliable Computing"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A formal theory of inductive inference. Information and Control\u00a07(1), 1\u201322 (1964)","journal-title":"Information and Control"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A formal theory of inductive inference. Information and Control\u00a07(2), 224\u2013254 (1964)","journal-title":"Information and Control"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/S0304-3975(01)00102-5","volume":"284","author":"L. Staiger","year":"2002","unstructured":"Staiger, L.: The Kolmogorov complexity of real numbers. Theoretical Computer Science\u00a0284(2), 455\u2013466 (2002)","journal-title":"Theoretical Computer Science"},{"key":"9_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis, An Introduction","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis, An Introduction. Springer, Heidelberg (2000)"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.entcs.2008.12.014","volume":"221","author":"M. Ziegler","year":"2008","unstructured":"Ziegler, M., Koolen, W.M.: Kolmogorov complexity theory over the reals. Electronic Notes in Theoretical Computer Science\u00a0221, 153\u2013169 (2008); Proceedings of the Fifth International Conference on Computability and Complexity in Analysis (CCA 2008)","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Models of Computation in Context"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21875-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T04:49:24Z","timestamp":1554180564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21875-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642218743","9783642218750"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21875-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}