{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:46:52Z","timestamp":1764132412579,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_25","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T11:16:31Z","timestamp":1185275791000},"page":"238-247","source":"Crossref","is-referenced-by-count":11,"title":["Abstract Geometrical Computation and the Linear\u00a0Blum, Shub and Smale Model"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Durand-Lose","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/11750321_60","volume-title":"Theory and Applications of Models of Computation","author":"O. Bournez","year":"2006","unstructured":"Bournez, O., Campagnolo, M.L., Gra\u00e7a, D.S., Hainry, E.: The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 631\u2013643. Springer, Heidelberg (2006)"},{"key":"25_CR2","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":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-27836-8_25","volume-title":"Automata, Languages and Programming","author":"O. Bournez","year":"2004","unstructured":"Bournez, O., Hainry, E.: An analog characterization of elementarily computable functions over the real numbers. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 269\u2013280. Springer, Heidelberg (2004)"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s002240000111","volume":"32","author":"O. Bournez","year":"1999","unstructured":"Bournez, O.: Some bounds on the computational power of piecewise constant derivative systems. Theory of Computing Systems\u00a032(1), 35\u201367 (1999)","journal-title":"Theory of Computing Systems"},{"key":"25_CR5","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 (extended abstract). In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 176\u2013187. Springer, Heidelberg (2005)"},{"issue":"4","key":"25_CR6","first-page":"491","volume":"74","author":"J. Durand-Lose","year":"2006","unstructured":"Durand-Lose, J.: Abstract geometrical computation\u00a01: embedding black hole computations with rational numbers. Fundamenta Informaticae\u00a074(4), 491\u2013510 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"25_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":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11780342_18","volume-title":"Logical Approaches to Computational Barriers","author":"J. Durand-Lose","year":"2006","unstructured":"Durand-Lose, J.: Reversible conservative rational abstract geometrical computation is turing-universal. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 163\u2013172. Springer, Heidelberg (2006)"},{"key":"25_CR9","first-page":"486","volume-title":"34th Annual Symposium on Foundations of Computer Science (FOCS\u00a0\u201993)","author":"P. Koiran","year":"1993","unstructured":"Koiran, P.: A weak version of the Blum, Shub & Smale model. In: 34th Annual Symposium on Foundations of Computer Science (FOCS\u00a0\u201993), pp. 486\u2013495. IEEE, Washington (1993)"},{"key":"25_CR10","first-page":"113","volume":"4","author":"K. Meer","year":"1997","unstructured":"Meer, K., Michaux, C.: A survey on real structural complexity theory. Bulletin of the Belgian Mathematical Society\u00a04, 113\u2013148 (1997)","journal-title":"Bulletin of the Belgian Mathematical Society"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(95)00248-0","volume":"162","author":"C. Moore","year":"1996","unstructured":"Moore, C.: Recursion theory on the reals and continuous-time computation. Theoret. Comp. Sci.\u00a0162(1), 23\u201344 (1996)","journal-title":"Theoret. Comp. Sci."},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/jcom.1995.1002","volume":"11","author":"E. Novak","year":"1995","unstructured":"Novak, E.: The real number model in numerical analysis. J. Complex.\u00a011(1), 57\u201373 (1995)","journal-title":"J. Complex."},{"key":"25_CR13","volume-title":"Texts in Theoretical computer science","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Introduction to computable analysis. In: Texts in Theoretical computer science, Springer, Berlin (2000)"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:30:36Z","timestamp":1558470636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}