{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:54:59Z","timestamp":1725605699688},"publisher-location":"Berlin, Heidelberg","reference-count":26,"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_19","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T07:51:59Z","timestamp":1315468319000},"page":"181-190","source":"Crossref","is-referenced-by-count":1,"title":["Multi-Resolution Cellular Automata for Real Computation"],"prefix":"10.1007","author":[{"given":"James I.","family":"Lathrop","sequence":"first","affiliation":[]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Patterson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(98)00284-9","volume":"219","author":"V. Brattka","year":"1999","unstructured":"Brattka, V., Weihrauch, K.: Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science\u00a0219, 65\u201393 (1999)","journal-title":"Theoretical Computer Science"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Braverman, M.: On the complexity of real functions. In: Forty-Sixth Annual IEEE Symposium on Foundations of Computer Science, pp. 155\u2013164 (2005)","DOI":"10.1109\/SFCS.2005.58"},{"issue":"3","key":"19_CR3","first-page":"318","volume":"53","author":"M. Braverman","year":"2006","unstructured":"Braverman, M., Cook, S.: Computing over the reals: Foundations for scientific computing. Notices of the AMS\u00a053(3), 318\u2013329 (2006)","journal-title":"Notices of the AMS"},{"volume-title":"Essays on Cellular Automata","year":"1970","author":"A. Burks","key":"19_CR4","unstructured":"Burks, A.: Essays on Cellular Automata. Univeristy of Illinois Press, US (1970)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Carroll, L.: Alice\u2019s Adventures in Wonderland. Project Gutenberg (2008)","DOI":"10.1017\/CBO9781139568555"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1015607401307","volume":"12","author":"B.J. Copeland","year":"2002","unstructured":"Copeland, B.J.: Accelerating Turing machines. Minds and Machines\u00a012, 281\u2013301 (2002)","journal-title":"Minds and Machines"},{"key":"19_CR7","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195137170.001.0001","volume-title":"New Constructions in Cellular Automata","author":"D. Griffeath","year":"2003","unstructured":"Griffeath, D., Moore, C.: New Constructions in Cellular Automata. Oxford University Press, USA (2003)"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4064\/fm-42-1-168-202","volume":"42","author":"A. Grzegorczyk","year":"1955","unstructured":"Grzegorczyk, A.: Computable functionals. Fundamenta Mathematicae\u00a042, 168\u2013202 (1955)","journal-title":"Fundamenta Mathematicae"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"J.D. Hamkins","year":"2000","unstructured":"Hamkins, J.D., Lewis, A.: Infinite time Turing machines. Journal of Symbolic Logic\u00a065(2), 567\u2013604 (2000)","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"K. Ko","year":"1982","unstructured":"Ko, K., Friedman, H.: Computational complexity of real functions. Theoretical Computer Science\u00a020, 323\u2013352 (1982)","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K.-I. Ko","year":"1991","unstructured":"Ko, K.-I.: Complexity Theory of Real Functions. Birkh\u00e4user, Boston (1991)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BFb0009642","volume-title":"Theoretical Computer Science","author":"C. Kreitz","year":"1982","unstructured":"Kreitz, C., Weihrauch, K.: Complexity theory on real numbers and functions. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol.\u00a0145, pp. 165\u2013174. Springer, Heidelberg (1982)"},{"key":"19_CR13","unstructured":"Lacombe, D.: Extension de la notion de fonction recursive aux fonctions d\u2019une ow plusiers variables reelles, and other notes. Comptes Rendus (1955), 240:2478-2480; 241:13-14, 151-153, 1250-1252"},{"volume-title":"One Dimensional Cellular Automata","year":"2009","author":"H.V. McIntosh","key":"19_CR14","unstructured":"McIntosh, H.V.: One Dimensional Cellular Automata. Luniver Press, United Kingdom (2009)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-94-017-2732-7_13","volume-title":"Potentiality, Entanglement and Passion-at-a-Distance: Quantum Mechanical Studies for Abner Shimony","author":"W.C. Myrvold","year":"1997","unstructured":"Myrvold, W.C.: The decision problem for entanglement. In: Cohen, R.S., Horne, M.S.J. (eds.) Potentiality, Entanglement and Passion-at-a-Distance: Quantum Mechanical Studies for Abner Shimony, pp. 177\u2013190. Kluwer Academic Publishers, Dordrecht and Boston (1997)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1086\/375472","volume":"70","author":"M.W. Parker","year":"2003","unstructured":"Parker, M.W.: Undecidability in \u211d n : Riddled basins, the KAM tori, and the stability of the solar system. Philosophy of Science\u00a070, 359\u2013382 (2003)","journal-title":"Philosophy of Science"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2005.09.052","volume":"351","author":"M.W. Parker","year":"2006","unstructured":"Parker, M.W.: Three concepts of decidability for general subsets of uncountable spaces. Theoretical Computer Science\u00a0351, 2\u201313 (2006)","journal-title":"Theoretical Computer Science"},{"key":"19_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"M.B. Pour-El","year":"1989","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Heidelberg (1989)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1140\/epjb\/e2009-00147-x","volume":"69","author":"M. Schaller","year":"2009","unstructured":"Schaller, M., Svozil, K.: Scale-invariant cellular automata and self-similar Petri nets. The European Physical Journal B\u00a069, 297\u2013311 (2009)","journal-title":"The European Physical Journal B"},{"volume-title":"Cellular Automata: A Discrete View of the World","year":"2008","author":"J. Schiff","key":"19_CR20","unstructured":"Schiff, J.: Cellular Automata: A Discrete View of the World. Wiley Interscience, USA (2008)"},{"issue":"2","key":"19_CR21","first-page":"230","volume":"42","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers with an application to the Entscheidungsproblem. Proc. London Math. Soc.\u00a042(2), 230\u2013265 (1936)","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"19_CR22","first-page":"544","volume":"43","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers with an application to the Entscheidungsproblem. A correction. Proc. London Math. Soc.\u00a043(2), 544\u2013546 (1936)","journal-title":"A correction. Proc. London Math. Soc."},{"key":"19_CR23","unstructured":"Turing, A.M.: Systems of Logic Based on Ordinals. Ph.D. thesis, Princeton, New Jersey, USA (1938)"},{"key":"19_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69965-8","volume-title":"Computability","author":"K. Weihrauch","year":"1987","unstructured":"Weihrauch, K.: Computability. Springer, New York (1987)"},{"key":"19_CR25","series-title":"An Introduction","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. An Introduction. Springer, Heidelberg (2000)"},{"key":"19_CR26","unstructured":"Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign, Illinois, USA (2002)"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T17:39:35Z","timestamp":1638553175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21875-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642218743","9783642218750"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21875-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}
