{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:11:44Z","timestamp":1761973904340,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_12","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T04:28:12Z","timestamp":1370233692000},"page":"108-119","source":"Crossref","is-referenced-by-count":4,"title":["Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Durand-Lose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Becker, F., Chapelle, M., Durand-Lose, J., Levorato, V., Senot, M.: Abstract geometrical computation 8: Small machines, accumulations & rationality. Draft (2013)"},{"key":"12_CR2","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.\u00a01256, pp. 143\u2013153. Springer, Heidelberg (1997)"},{"key":"12_CR3","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 Systems\u00a015, 1\u201340 (2004)","journal-title":"Complex Systems"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-29952-0_42","volume-title":"Theory and Applications of Models of Computation","author":"D. Duchier","year":"2012","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.\u00a07287, pp. 435\u2013447. Springer, Heidelberg (2012)"},{"key":"12_CR5","unstructured":"Durand-Lose, J.: Calculer g\u00e9om\u00e9triquement sur le plan \u2013\u00a0machines \u00e0 signaux. Habilitation \u00e0 Diriger des Recherches, \u00c9cole Doctorale STIC, Universit\u00e9 de Nice-Sophia Antipolis (2003) (in French)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/11494645_14","volume-title":"New Computational Paradigms","author":"J. Durand-Lose","year":"2005","unstructured":"Durand-Lose, J.: Abstract geometrical computation: Turing-computing ability and undecidability. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 106\u2013116. Springer, Heidelberg (2005)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/11750321_61","volume-title":"Theory and Applications of Models of Computation","author":"J. Durand-Lose","year":"2006","unstructured":"Durand-Lose, J.: Forcasting black holes in abstract geometrical computation is highly unpredictable. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 644\u2013653. Springer, Heidelberg (2006)"},{"key":"12_CR8","unstructured":"Durand-Lose, J.: The signal point of view: from cellular automata to signal machines. In: Durand, B. (ed.) Journ\u00e9es Automates Cellulaires (JAC\u00a02008), pp. 238\u2013249 (2008)"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s11047-009-9117-0","volume":"8","author":"J. Durand-Lose","year":"2009","unstructured":"Durand-Lose, J.: Abstract geometrical computation\u00a03: Black holes for classical and analog computing. Nat. Comput.\u00a08(3), 455\u2013472 (2009)","journal-title":"Nat. Comput."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2010.07.013","volume":"412","author":"J. Durand-Lose","year":"2011","unstructured":"Durand-Lose, J.: Abstract geometrical computation 4: small Turing universal signal machines. Theoret. Comp. Sci.\u00a0412, 57\u201367 (2011)","journal-title":"Theoret. Comp. Sci."},{"key":"12_CR11","unstructured":"Durand-Lose, J.: Abstract geometrical computation\u00a07: Geometrical accumulations and computably enumerable real numbers. Nat. Comput.\u00a011(4), 609\u2013622 (2012), Special issue on Unconv. Comp. 2011"},{"issue":"1","key":"12_CR12","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. Comp. Sci.\u00a068(1), 71\u201387 (1989)","journal-title":"Theoret. Comp. Sci."},{"issue":"1","key":"12_CR13","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. Comp. Sci.\u00a073(1), 1\u201346 (1990)","journal-title":"Theoret. Comp. Sci."},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(99)00102-4","volume":"231","author":"M. Margenstern","year":"2000","unstructured":"Margenstern, M.: Frontier between decidability and undecidability: A survey. Theor. Comput. Sci.\u00a0231(2), 217\u2013251 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02127801","volume":"16","author":"J. Mazoyer","year":"1996","unstructured":"Mazoyer, J.: Computations on one dimensional cellular automata. Ann. Math. Artif. Intell.\u00a016, 285\u2013309 (1996)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0304-3975(98)00150-9","volume":"217","author":"J. Mazoyer","year":"1999","unstructured":"Mazoyer, J., Terrier, V.: Signals in one-dimensional cellular automata. Theoret. Comp. Sci.\u00a0217(1), 53\u201380 (1999)","journal-title":"Theoret. Comp. Sci."},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/11839132_16","volume-title":"Unconventional Computation","author":"J. Mycka","year":"2006","unstructured":"Mycka, J., Coelho, F., Costa, J.F.: The euclid abstract machine: Trisection of the angle and the halting problem. In: Calude, C.S., Dinneen, M.J., P\u0103un, G., Rozenberg, G., Stepney, S. (eds.) UC 2006. LNCS, vol.\u00a04135, pp. 195\u2013206. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2010.08.018","volume":"412","author":"N. Ollinger","year":"2011","unstructured":"Ollinger, N., Richard, G.: Four states are enough? Theoret. Comp. Sci.\u00a0412(1-2), 22\u201332 (2011)","journal-title":"Theoret. Comp. Sci."},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(96)00077-1","volume":"168","author":"Y.V. Rogozhin","year":"1996","unstructured":"Rogozhin, Y.V.: Small universal Turing machines. Theoret. Comp. Sci.\u00a0168(2), 215\u2013240 (1996)","journal-title":"Theoret. Comp. Sci."},{"issue":"4-5","key":"12_CR20","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. Comp. Sci.\u00a0410(4-5), 443\u2013450 (2009)","journal-title":"Theoret. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T11:44:11Z","timestamp":1746013451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}