{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:04Z","timestamp":1750221064563,"version":"3.41.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319581866"},{"type":"electronic","value":"9783319581873"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-58187-3_2","type":"book-chapter","created":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T15:10:58Z","timestamp":1493305858000},"page":"8-25","source":"Crossref","is-referenced-by-count":1,"title":["Ways to Compute in Euclidean Frameworks"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Durand-Lose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,28]]},"reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s11047-009-9114-3","volume":"8","author":"H Andr\u00e9ka","year":"2009","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I., N\u00e9meti, P.: General relativistic hypercomputing and foundation of mathematics. Nat. Comput. 8(3), 499\u2013516 (2009). doi: 10.1007\/s11047-009-9114-3","journal-title":"Nat. Comput."},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-60692-0_68","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"E Asarin","year":"1995","unstructured":"Asarin, E., Maler, O.: Achilles and the Tortoise climbing up the arithmetical hierarchy. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 471\u2013483. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60692-0_68"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(94)00228-B","volume":"138","author":"E Asarin","year":"1995","unstructured":"Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoret. Comput. Sci. 138(1), 35\u201365 (1995). doi: 10.1016\/0304-3975(94)00228-B","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR4","unstructured":"Becker, F., Chapelle, M., Durand-Lose, J., Levorato, V., Senot, M.: Abstract geometrical computation 8: small machines, accumulations & rationality (2013, submitted). http:\/\/arxiv.org\/abs\/1307.6468"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1147\/rd.321.0016","volume":"32","author":"CH Bennett","year":"1988","unstructured":"Bennett, C.H.: Notes on the history of reversible computation. IBM J. Res. Dev. 32(1), 16\u201323 (1988)","journal-title":"IBM J. Res. Dev."},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-319-39300-1_6","volume-title":"Cellular Automata and Discrete Complex Systems","author":"T Besson","year":"2016","unstructured":"Besson, T., Durand-Lose, J.: Exact discretization of 3-speed rational signal machines into cellular automata. In: Cook, M., Neary, T. (eds.) AUTOMATA 2016. LNCS, vol. 9664, pp. 63\u201376. Springer, Cham (2016). doi: 10.1007\/978-3-319-39300-1_6"},{"issue":"1","key":"2_CR7","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. Bull. Am. Math. Soc. 21(1), 1\u201346 (1989)","journal-title":"Bull. Am. Math. Soc."},{"key":"2_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L Blum","year":"1998","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, New York (1998)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-63165-8_172","volume-title":"Automata, Languages and Programming","author":"O Bournez","year":"1997","unstructured":"Bournez, O.: Some bounds on the computational power of piecewise constant derivative systems (extended abstract). In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 143\u2013153. Springer, Heidelberg (1997). doi: 10.1007\/3-540-63165-8_172"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Bournez, O.: Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy. Theoret. Comput. Sci. 210(1), 21\u201371 (1999a)","DOI":"10.1016\/S0304-3975(98)00096-6"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Bournez, O.: Some bounds on the computational power of piecewise constant derivative systems. Theory Comput. Syst. 32(1), 35\u201367 (1999b)","DOI":"10.1007\/s002240000111"},{"key":"2_CR12","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04978-5","volume-title":"Information and Randomness: An Algorithmic Perspective","author":"CS Calude","year":"2002","unstructured":"Calude, C.S.: Information and Randomness: An Algorithmic Perspective. Texts in Theoretical Computer Science. An EATCS Series, 2nd edn. Springer, Heidelberg (2002). doi: 10.1007\/978-3-662-04978-5 . ISBN 3540434666","edition":"2"},{"key":"2_CR13","series-title":"Copernicus Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4072-3","volume-title":"The Book of Numbers","author":"JH Conway","year":"1996","unstructured":"Conway, J.H., Guy, R.L.: The Book of Numbers. Copernicus Series. Springer, Heidelberg (1996). ISBN 9780387979939"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.25088\/ComplexSystems.15.1.1","volume":"15","author":"M Cook","year":"2004","unstructured":"Cook, M.: Universality in elementary cellular automata. Complex Syst. 15, 1\u201340 (2004)","journal-title":"Complex Syst."},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Duchier, D., Durand-Lose, J., Senot, M.: Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol. 7287, pp. 435\u2013447. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29952-0_42 . http:\/\/arxiv.org\/abs\/1105.3454","DOI":"10.1007\/978-3-642-29952-0_42"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-31834-7_14","volume-title":"Machines, Computations, and Universality","author":"J Durand-Lose","year":"2005","unstructured":"Durand-Lose, J.: Abstract geometrical computation for black hole computation. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 176\u2013187. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-31834-7_14"},{"issue":"4","key":"2_CR17","first-page":"491","volume":"74","author":"J Durand-Lose","year":"2006","unstructured":"Durand-Lose, J.: Abstract geometrical computation 1: embedding black hole computations with rational numbers. Fund. Inf. 74(4), 491\u2013510 (2006)","journal-title":"Fund. Inf."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-73001-9_25","volume-title":"Computation and Logic in the Real World","author":"J Durand-Lose","year":"2007","unstructured":"Durand-Lose, J.: Abstract geometrical computation and the linear blum, shub and smale model. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 238\u2013247. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73001-9_25"},{"key":"2_CR19","unstructured":"Durand-Lose, J.: The signal point of view: from cellular automata to signal machines. In: Durand, B. (ed.) Journees Automates cellulaires (JAC 2008), pp. 238\u2013249 (2008)"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-03745-0_20","volume-title":"Unconventional Computation","author":"J Durand-Lose","year":"2009","unstructured":"Durand-Lose, J.: Abstract geometrical computation and computable analysis. In: Calude, C.S., Costa, J.F., Dershowitz, N., Freire, E., Rozenberg, G. (eds.) UC 2009. LNCS, vol. 5715, pp. 158\u2013167. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03745-0_20"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Durand-Lose, J.: Abstract geometrical computation 5: embedding computable analysis. Nat. Comput. 10(4), 1261\u20131273 (2011a). doi: 10.1007\/s11047-010-9229-6 . Special issue on Unconv. Comp. 2009","DOI":"10.1007\/s11047-010-9229-6"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Durand-Lose, J.: Abstract geometrical computation 4: small Turing universal signal machines. Theoret. Comput. Sci. 412, 57\u201367 (2011b). doi: 10.1016\/.tcs.2010.07.013","DOI":"10.1016\/.tcs.20"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Durand-Lose, J.: Geometrical accumulations and computably enumerable real numbers. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds.) UC 2011. LNCS, vol. 6714, pp. 101\u2013112. Springer, Heidelberg (2011c). doi: 10.1007\/978-3-642-21341-0_15","DOI":"10.1007\/978-3-642-21341-0_15"},{"issue":"1","key":"2_CR24","first-page":"33","volume":"8","author":"J Durand-Lose","year":"2012","unstructured":"Durand-Lose, J.: Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation. Int. J. Unconv. Comput. 8(1), 33\u201346 (2012)","journal-title":"Int. J. Unconv. Comput."},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-39053-1_12","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"J Durand-Lose","year":"2013","unstructured":"Durand-Lose, J.: Irrationality is needed to compute with signal machines with only three speeds. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 108\u2013119. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39053-1_12 . http:\/\/cie2013.disco.unimib.it\/ . Invited talk for special session Computation in nature"},{"key":"2_CR26","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-33924-5_6","volume-title":"Advances in Unconventional Computing","author":"J Durand-Lose","year":"2017","unstructured":"Durand-Lose, J.: Computing in perfect euclidean frameworks. In: Adamatzky, A. (ed.) Advances in Unconventional Computing. ECC, vol. 22, pp. 141\u2013163. Springer, Cham (2017). doi: 10.1007\/978-3-319-33924-5_6"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Etesi, G., N\u00e9meti, I.: Non-turing computations via Malament-Hogarth space-times. Int. J. Theoret. Phys. 41(2), 341\u2013370 (2002). http:\/\/arxiv.org\/abs\/gr-qc\/0104023","DOI":"10.1023\/A:1014019225365"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/11560319_12","volume-title":"Unconventional Computation","author":"M Hagiya","year":"2005","unstructured":"Hagiya, M.: Discrete state transition systems on continuous space-time: a theoretical model for amorphous computing. In: Calude, C.S., Dinneen, M.J., P\u0103un, G., P\u00e9rez-J\u00edmenez, M.J., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 117\u2013129. Springer, Heidelberg (2005). doi: 10.1007\/11560319_12"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1093\/bjps\/55.4.681","volume":"55","author":"ML Hogarth","year":"2004","unstructured":"Hogarth, M.L.: Deciding arithmetic using SAD computers. Br. J. Philos. Sci. 55, 681\u2013691 (2004)","journal-title":"Br. J. Philos. Sci."},{"issue":"1","key":"2_CR30","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(89)90120-5","volume":"68","author":"U Huckenbeck","year":"1989","unstructured":"Huckenbeck, U.: Euclidian geometry in terms of automata theory. Theoret. Comput. Sci. 68(1), 71\u201387 (1989). doi: 10.1016\/0304-3975(89)90120-5","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"2_CR31","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(91)90375-C","volume":"88","author":"U Huckenbeck","year":"1991","unstructured":"Huckenbeck, U.: A result about the power of geometric oracle machines. Theoret. Comput. Sci. 88(2), 231\u2013251 (1991). doi: 10.1016\/0304-3975(91)90375-C","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"2_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(90)90160-J","volume":"73","author":"G Jacopini","year":"1990","unstructured":"Jacopini, G., Sontacchi, G.: Reversible parallel computation: an evolving space-model. Theoret. Comput. Sci. 73(1), 1\u201346 (1990). doi: 10.1016\/0304-3975(90)90160-J","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR33","unstructured":"Lecerf, Y.: Machines de Turing r\u00e9versibles. R\u00e9cursive insolubilit\u00e9 en $$n\\in {\\mathbb{N}}$$ de l\u2019\u00e9quation $$u = \\theta ^nu$$ , o\u00f9 $$\\theta $$ est un isomorphisme de codes. Comptes rendus des s\u00e9ances de l\u2019acad\u00e9mie des sciences 257, 2597\u20132600 (1963)"},{"key":"2_CR34","doi-asserted-by":"crossref","first-page":"113","DOI":"10.36045\/bbms\/1105730626","volume":"4","author":"K Meer","year":"1997","unstructured":"Meer, K., Michaux, C.: A survey on real structural complexity theory. Bull. Belg. Math. Soc. 4, 113\u2013148 (1997)","journal-title":"Bull. Belg. Math. Soc."},{"issue":"3","key":"2_CR35","first-page":"223","volume":"E72","author":"K Morita","year":"1989","unstructured":"Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Trans. IEICE E72(3), 223\u2013228 (1989)","journal-title":"Trans. IEICE"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45132-3_20","volume-title":"Machines, Computations, and Universality","author":"TJ Naughton","year":"2001","unstructured":"Naughton, T.J., Woods, D.: On the computational power of a continuous-space optical model of computation. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 288\u2013299. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45132-3_20"},{"key":"2_CR37","unstructured":"Senot, M.: Mod\u00e8le g\u00e9om\u00e9trique de calcul: fractales et barri\u00e8res de complexit\u00e9. Th\u00e8se de doctorat, Universit\u00e9 d\u2019Orl\u00e9ans, June 2013. https:\/\/tel.archives-ouvertes.fr\/tel-00870600"},{"key":"2_CR38","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Co., Boston (1997). ISBN 0-534-944728-X"},{"key":"2_CR39","volume-title":"Hypercomputation","author":"A Syropoulos","year":"2010","unstructured":"Syropoulos, A.: Hypercomputation. Springer, Heidelberg (2010)"},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.entcs.2004.06.043","volume":"120","author":"I Takeuti","year":"2005","unstructured":"Takeuti, I.: Transition systems over continuous time-space. Electron. Notes Theoret. Comput. Sci. 120, 173\u2013186 (2005). doi: 10.1016\/j.entcs.2004.06.043","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"2_CR41","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Introduction to computable analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Introduction to computable analysis. Texts in Theoretical Computer Science. Springer, Berlin (2000)"},{"issue":"1\u20133","key":"2_CR42","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.tcs.2004.07.001","volume":"334","author":"D Woods","year":"2005","unstructured":"Woods, D., Naughton, T.J.: An optical model of computation. Theoret. Comput. Sci. 334(1\u20133), 227\u2013258 (2005). doi: 10.1016\/j.tcs.2004.07.001","journal-title":"Theoret. Comput. Sci."},{"issue":"4\u20135","key":"2_CR43","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.tcs.2008.09.051","volume":"410","author":"D Woods","year":"2009","unstructured":"Woods, D., Neary, T.: The complexity of small universal Turing machines: a survey. Theoret. Comput. Sci. 410(4\u20135), 443\u2013450 (2009). doi: 10.1016\/j.tcs.2008.09.051","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58187-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:49:28Z","timestamp":1750207768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58187-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319581866","9783319581873"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58187-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}