Abstract
We propose a formalization of analog algorithms, extending the framework of abstract state machines to continuous-time models of computation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Wikipedia. MONIAC computer, http://en.wikipedia.org/wiki/MONIAC_Computer (viewed March 1, 2012)
Blass, A., Dershowitz, N., Gurevich, Y.: Exact Exploration and Hanging Algorithms. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 140–154. Springer, Heidelberg (2010), http://nachum.org/papers/HangingAlgorithms.pdf (viewed May 27, 2011)
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) 21, 1–46 (1989)
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. 4800, pp. 199–229. Springer, Heidelberg (2008), http://nachum.org/papers/ArbitraryDomains.pdf (viewed January 10, 2012)
Boker, U., Dershowitz, N.: Three Paths to Effectiveness. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol. 6300, pp. 135–146. Springer, Heidelberg (2010), http://nachum.org/papers/ThreePathsToEffectiveness.pdf (viewed January 10, 2012)
Bush, V.: The differential analyser. Journal of the Franklin Institute 212(4), 447–488 (1931)
Bournez, O., Campagnolo, M.L.: A survey on continuous time computations. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) New Computational Paradigms Changing Conceptions of What is Computable, pp. 383–423. Springer, New York (2008)
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–396 (2005)
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)
Coward, D.: Doug Coward’s Analog Computer Museum (2006), http://www.cowardstereoview.com/analog/ (viewed January 10, 2012)
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), http://nachum.org/papers/ECTT.pdf (viewed January 10, 2012)
Dershowitz, N., Gurevich, Y.: A natural axiomatization of computability and proof of Church’s Thesis. The Bulletin of Symbolic Logic 14(3), 299–350 (2009), http://nachum.org/papers/Church.pdf (viewed April 15, 2009)
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. 4624, pp. 242–256. Springer, Heidelberg (2007)
Gurevich, Y.: Evolving algebras 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press (1995), http://research.microsoft.com/~gurevich/opera/103.pdf (viewed April 15, 2009)
Gurevich, Y.: Sequential abstract-state machines capture sequential algorithms. ACM Transactions on Computational Logic 1, 77–111 (2000), http://research.microsoft.com/~gurevich/opera/141.pdf (viewed April 15, 2009)
Gurevich, Y., Yavorskaya, T.: On bounded exploration and bounded nondeterminism. Technical Report MSR-TR-2006-07, Microsoft Research, Redmond, WA (January 2006), http://research.microsoft.com/~gurevich/opera/177.pdf (viewed January 10, 2012)
Reisig, W.: On Gurevich’s theorem on sequential algorithms. Acta Informatica 39(5), 273–305 (2003)
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–356 (March 2000)
Shannon, C.E.: Mathematical theory of the differential analyser. Journal of Mathematics and Physics 20, 337–354 (1941)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bournez, O., Dershowitz, N., Falkovich, E. (2012). Towards an Axiomatization of Simple Analog Algorithms. In: Agrawal, M., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2012. Lecture Notes in Computer Science, vol 7287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29952-0_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-29952-0_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29951-3
Online ISBN: 978-3-642-29952-0
eBook Packages: Computer ScienceComputer Science (R0)