{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T13:47:06Z","timestamp":1751982426009,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_49","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"525-536","source":"Crossref","is-referenced-by-count":5,"title":["Towards an Axiomatization of Simple Analog Algorithms"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Bournez","sequence":"first","affiliation":[]},{"given":"Nachum","family":"Dershowitz","sequence":"additional","affiliation":[]},{"given":"Evgenia","family":"Falkovich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","unstructured":"Wikipedia. MONIAC computer, \n                      http:\/\/en.wikipedia.org\/wiki\/MONIAC_Computer\n                     (viewed March 1, 2012)"},{"key":"49_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-15205-4_14","volume-title":"Computer Science Logic","author":"A. Blass","year":"2010","unstructured":"Blass, A., Dershowitz, N., Gurevich, Y.: Exact Exploration and Hanging Algorithms. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 140\u2013154. Springer, Heidelberg (2010), \n                      http:\/\/nachum.org\/papers\/HangingAlgorithms.pdf\n                     (viewed May 27, 2011)"},{"key":"49_CR3","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. Amer. Math. Soc. (NS)\u00a021, 1\u201346 (1989)","journal-title":"Bull. Amer. Math. Soc. (NS)"},{"key":"49_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-78127-1_12","volume-title":"Pillars of Computer Science","author":"U. Boker","year":"2008","unstructured":"Boker, U., Dershowitz, N.: The Church-Turing Thesis over Arbitrary Domains. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol.\u00a04800, pp. 199\u2013229. Springer, Heidelberg (2008), \n                      http:\/\/nachum.org\/papers\/ArbitraryDomains.pdf\n                     (viewed January 10, 2012)"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-15025-8_7","volume-title":"Fields of Logic and Computation","author":"U. Boker","year":"2010","unstructured":"Boker, U., Dershowitz, N.: Three Paths to Effectiveness. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol.\u00a06300, pp. 135\u2013146. Springer, Heidelberg (2010), \n                      http:\/\/nachum.org\/papers\/ThreePathsToEffectiveness.pdf\n                     (viewed January 10, 2012)"},{"issue":"4","key":"49_CR6","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0016-0032(31)90616-9","volume":"212","author":"V. Bush","year":"1931","unstructured":"Bush, V.: The differential analyser. Journal of the Franklin Institute\u00a0212(4), 447\u2013488 (1931)","journal-title":"Journal of the Franklin Institute"},{"key":"49_CR7","first-page":"383","volume-title":"New Computational Paradigms Changing Conceptions of What is Computable","author":"O. Bournez","year":"2008","unstructured":"Bournez, O., Campagnolo, M.L.: A survey on continuous time computations. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) New Computational Paradigms Changing Conceptions of What is Computable, pp. 383\u2013423. Springer, New York (2008)"},{"key":"49_CR8","unstructured":"Cohen, J., Slissenko, A.: On implementations of instantaneous actions real-time ASM by ASM with delays. In: Proc. of the 12th Intern. Workshop on Abstract State Machines (ASM 2005), Paris, France, pp. 387\u2013396 (2005)"},{"key":"49_CR9","volume-title":"Proc. of the 6th Intern. Conf. on Computer Science and Information Technology (CSIT 2007)","author":"J. Cohen","year":"2007","unstructured":"Cohen, J., Slissenko, A.: Implementation of sturdy real-time abstract state machines by machines with delays. In: Proc. of the 6th Intern. Conf. on Computer Science and Information Technology (CSIT 2007). Academy of Science of Armenia, Yerevan (2007)"},{"key":"49_CR10","unstructured":"Coward, D.: Doug Coward\u2019s Analog Computer Museum (2006), \n                      http:\/\/www.cowardstereoview.com\/analog\/\n                     (viewed January 10, 2012)"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Falkovich, E.: A formalization and proof of the Extended Church-Turing Thesis (extended abstract). In: Studia Logica Conference on Trends in Logic, IX: Church Thesis: Logic, Mind and Nature, Krakow, Poland (June 2011), \n                      http:\/\/nachum.org\/papers\/ECTT.pdf\n                     (viewed January 10, 2012)","DOI":"10.4204\/EPTCS.88.6"},{"issue":"3","key":"49_CR12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.2178\/bsl\/1231081370","volume":"14","author":"N. Dershowitz","year":"2009","unstructured":"Dershowitz, N., Gurevich, Y.: A natural axiomatization of computability and proof of Church\u2019s Thesis. The Bulletin of Symbolic Logic\u00a014(3), 299\u2013350 (2009), \n                      http:\/\/nachum.org\/papers\/Church.pdf\n                     (viewed April 15, 2009)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"49_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-540-73859-6_17","volume-title":"Algebra and Coalgebra in Computer Science","author":"A. Glausch","year":"2007","unstructured":"Glausch, A., Reisig, W.: A Semantic Characterization of Unbounded-Nondeterministic Abstract State Machines. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 242\u2013256. Springer, Heidelberg (2007)"},{"key":"49_CR14","unstructured":"Gurevich, Y.: Evolving algebras 1993: Lipari guide. In: B\u00f6rger, E. (ed.) Specification and Validation Methods, pp. 9\u201336. Oxford University Press (1995), \n                      http:\/\/research.microsoft.com\/~gurevich\/opera\/103.pdf\n                     (viewed April 15, 2009)"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y. Gurevich","year":"2000","unstructured":"Gurevich, Y.: Sequential abstract-state machines capture sequential algorithms. ACM Transactions on Computational Logic\u00a01, 77\u2013111 (2000), \n                      http:\/\/research.microsoft.com\/~gurevich\/opera\/141.pdf\n                     (viewed April 15, 2009)","journal-title":"ACM Transactions on Computational Logic"},{"key":"49_CR16","unstructured":"Gurevich, Y., Yavorskaya, T.: On bounded exploration and bounded nondeterminism. Technical Report MSR-TR-2006-07, Microsoft Research, Redmond, WA (January 2006), \n                      http:\/\/research.microsoft.com\/~gurevich\/opera\/177.pdf\n                     (viewed January 10, 2012)"},{"issue":"5","key":"49_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00236-002-0106-3","volume":"39","author":"W. Reisig","year":"2003","unstructured":"Reisig, W.: On Gurevich\u2019s theorem on sequential algorithms. Acta Informatica\u00a039(5), 273\u2013305 (2003)","journal-title":"Acta Informatica"},{"key":"49_CR18","unstructured":"Rust, H.: Hybrid abstract state machines: Using the hyperreals for describing continuous changes in a discrete notation. In: Gurevich, Y., Kutter, P., Odersky, M., Thiele, L. (eds.) International Workshop on Abstract State Machines (Monte Verita, Switzerland), TIK-Report 87, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, pp. 341\u2013356 (March 2000)"},{"key":"49_CR19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/sapm1941201337","volume":"20","author":"C.E. Shannon","year":"1941","unstructured":"Shannon, C.E.: Mathematical theory of the differential analyser. Journal of Mathematics and Physics\u00a020, 337\u2013354 (1941)","journal-title":"Journal of Mathematics and Physics"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T14:31:34Z","timestamp":1676644294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}