Skip to main content
SpringerLink
Log in
Book cover

Conference on Computability in Europe

CiE 2016: Pursuit of the Universal pp 215–224Cite as

Axiomatizing Analog Algorithms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9709))

Abstract

We propose a formalization of generic algorithms that includes analog algorithms. This is achieved by reformulating and extending the framework of abstract state machines to include continuous-time models of computation. We prove that every hybrid algorithm satisfying some reasonable postulates may be expressed precisely by a program in a simple and expressive language.

O. Bournez—This author’s research was partially supported by a French National Research Agency’s grant (ANR-15-CE40-0016-02).

N. Dershowitz—This author’s research benefited from a fellowship at the Institut d’Études Avancées de Paris (France), with the financial support of the French National Research Agency’s “Investissements d’avenir” program (ANR-11-LABX-0027-01 Labex RFIEA+).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. 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–46 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. Bournez, O., Campagnolo, M.L.: A survey on continuous time computations. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) Changing Conceptions of What is Computable, pp. 383–423. Springer, New York (2008)

    Chapter  Google Scholar 

  5. Bournez, O., Dershowitz, N., Falkovich, E.: Towards an axiomatization of simple analog algorithms. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol. 7287, pp. 525–536. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Bournez, O., Dershowitz, N., Néron, P.: Axiomatizing analog algorithms. ArXiv e-prints (2016). http://arxiv.org/abs/1604.04295

  7. Bush, V.: The differential analyser. J. Franklin Inst. 212, 447–488 (1931)

    Article  MATH  Google Scholar 

  8. Cohen, J., Slissenko, A.: On implementations of instantaneous actions real-time ASM by ASM with delays. In: Proceedings of 12th International Workshop on Abstract State Machines, Université de Paris, vol. 12, pp. 387–396 (2005)

    Google Scholar 

  9. Cohen, J., Slissenko, A.: Implementation of sturdy real-time abstract state machines by machines with delays. In: Proceedings of 6th International Conference on Computer Science and Information Technology, National Academy of Science of Armenia (2007)

    Google Scholar 

  10. Dershowitz, N., Gurevich, Y.: A natural axiomatization of computability and proof of Church’s Thesis. Bull. Symbolic Logic 14, 299–350 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fu, M.Q., Zucker, J.: Models of computation for partial functions on the reals. J. Log. Algebraic Methods Program. 84, 218–237 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  12. Graça, D.S., Buescu, J., Campagnolo, M.L.: Computational bounds on polynomial differential equations. Appl. Math. Comput. 215, 1375–1385 (2009)

    MathSciNet  MATH  Google Scholar 

  13. Graça, D.S., Costa, J.F.: Analog computers and recursive functions over the reals. J. Complex. 19, 644–664 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gurevich, Y.: Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log. 1, 77–111 (2000)

    Article  MathSciNet  Google Scholar 

  15. Hasuo, I., Suenaga, K.: Exercises in nonstandard static analysis of hybrid systems. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 462–478. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  16. Nyce, J.M.: Guest editor’s introduction. IEEE Ann. Hist. Comput. 18, 3–4 (1996)

    Article  Google Scholar 

  17. Platzer, A.: Differential dynamic logic for hybrid systems. J. Autom. Reasoning 41, 143–189 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Reisig, W.: On Gurevich’s theorem on sequential algorithms. Acta Informatica 39, 273–305 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. Rust, H.: Hybrid abstract state machines: using the hyperreals for describing continuous changes in a discrete notation. In: International Workshop on Abstract State Machines, Swiss Federal Institute of Technology, pp. 341–356 (2000)

    Google Scholar 

  20. Shannon, C.E.: Mathematical theory of the differential analyser. J. Math. Phys. 20, 337–354 (1941)

    Article  MathSciNet  MATH  Google Scholar 

  21. Suenaga, K., Hasuo, I.: Programming with infinitesimals: a While-language for hybrid system modeling. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 392–403. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  22. Tucker, J.V., Zucker, J.I.: A network model of analogue computation over metric algebras. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 515–529. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique de l’X (LIX), École Polytechnique, Palaiseau, France

    Olivier Bournez

  2. School of Computer Science, Tel Aviv University, Ramat Aviv, Israel

    Nachum Dershowitz

  3. French Network and Information Security Agency (ANSSI), Paris, France

    Pierre Néron

Authors
  1. Olivier Bournez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nachum Dershowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pierre Néron
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olivier Bournez .

Editor information

Editors and Affiliations

  1. Swansea University, Swansea, United Kingdom

    Arnold Beckmann

  2. Université Paris-Diderot - Paris 7, Paris, France

    Laurent Bienvenu

  3. University of South Florida, Tampa, Florida, USA

    Nataša Jonoska

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Bournez, O., Dershowitz, N., Néron, P. (2016). Axiomatizing Analog Algorithms. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds) Pursuit of the Universal. CiE 2016. Lecture Notes in Computer Science(), vol 9709. Springer, Cham. https://doi.org/10.1007/978-3-319-40189-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40189-8_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40188-1

  • Online ISBN: 978-3-319-40189-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation