Skip to main content
SpringerLink
Log in

On the Computational Capabilities of Several Models

  • Conference paper
Machines, Computations, and Universality (MCU 2007)

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

Included in the following conference series:

Abstract

We review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems.

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

Access this chapter

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Prasanna, V.K., Iyengar, S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, pp. 63–74. Springer, Heidelberg (2005)

    Google Scholar 

  2. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: Twenty-Third ACM Symposium on Principles of Distributed Computing, July 2004, pp. 290–299. ACM Press, New York (2004)

    Chapter  Google Scholar 

  3. Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: PODC 2006: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, New York, NY, USA, pp. 292–299. ACM Press, New York (2006)

    Chapter  Google Scholar 

  5. Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 79–90. Springer, Heidelberg (2006)

    Google Scholar 

  6. Artobolevskii, I.I.: Mechanisms for the generation of plane curves. Macmillan, New York, Translated by Wills, R.D., Johnson, W. (1964)

    Google Scholar 

  7. Axelrod, R.M.: The Evolution of Cooperation. Basic Books (1984)

    Google Scholar 

  8. Binmore, K.: Jeux et Théorie des jeux. DeBoeck Université, Paris-Bruxelles (1999) (Translated from ”Fun and Games: a text on game theory” by Bismans, F., Damaso, E.)

    Google Scholar 

  9. Bournez, O.: Modéles Continus. Calculs. Algorithmique Distribuée. Habilitationá diriger les recherches, Institut National Polytechnique de Lorraine (Décembre 7, 2006)

    Google Scholar 

  10. Brémaud, P.: Markov Chains, Gibbs Fields, Monte Carlo Simulation, and Queues. Springer, New York (2001)

    Google Scholar 

  11. Bush, V.: The differential analyser. Journal of the Franklin Institute 212(4), 447–488 (1931)

    Article  MATH  Google Scholar 

  12. Dyer, M.E., Goldberg, L.A., Greenhill, C.S., Istrate, G., Jerrum, M.: Convergence of the iterated prisoner’s dilemma game. Combinatorics, Probability & Computing 11(2) (2002)

    Google Scholar 

  13. Fribourg, L., Messika, S., Picaronny, C.: Coupling and self-stabilization. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 201–215. Springer, Heidelberg (2004)

    Google Scholar 

  14. Graça, D.: Computability with Polynomial Differential Equations. PhD thesis, Instituto Superior Técnico (2007)

    Google Scholar 

  15. Graça, D.S.: Some recent developments on Shannon’s general purpose analog computer. Mathematical Logic Quarterly 50(4-5), 473–485 (2004)

    MATH  Google Scholar 

  16. Graça, D.S., Costa, J.F.: Analog computers and recursive functions over the reals. Journal of Complexity 19(5), 644–664 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Hirsch, M.W., Smale, S., Devaney, R.: Differential Equations, Dynamical Systems, and an Introduction to Chaos. Elsevier Academic Press, Amsterdam (2003)

    Google Scholar 

  18. Hofbauer, J., Sigmund, K.: Evolutionary game dynamics. Bulletin of the American Mathematical Society 4, 479–519 (2003)

    Article  MathSciNet  Google Scholar 

  19. Kempe, A.B.: On a general method of describing plane curves of the n–th degree by linkwork. Proceedings of the London Mathematical Society 7, 213–216 (1876)

    Article  Google Scholar 

  20. Lipshitz, L., Rubel, L.A.: A differentially algebraic replacement theorem, and analog computability. Proceedings of the American Mathematical Society 99(2), 367–372 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  21. Maynard-Smith, J.: Evolution and the Theory of Games. Cambridge University Press, Cambridge (1981)

    Google Scholar 

  22. Murray, J.D.: Mathematical biology. I: An introduction. In: Biomathematics, 3rd edn., vol. 17, Springer, Heidelberg (2002)

    Google Scholar 

  23. Nash, J.F.: Equilibrium points in n-person games. Proc. of the National Academy of Sciences 36, 48–49 (1950)

    Article  MATH  MathSciNet  Google Scholar 

  24. Osbourne, Rubinstein: A Course in Game Theory. MIT Press, Cambridge (1994)

    Google Scholar 

  25. Pour-El, M.B.: Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers). Transactions of the American Mathematical Society 199, 1–28 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  26. Shannon, C.E.: Mathematical theory of the differential analyser. Journal of Mathematics and Physics MIT 20, 337–354 (1941)

    MATH  MathSciNet  Google Scholar 

  27. Svoboda, A.: Computing Mechanisms and Linkages. McGraw Hill (1948) (Dover reprint 1965)

    Google Scholar 

  28. Weibull, J.W.: Evolutionary Game Theory. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LORIA/INRIA, 615 Rue du Jardin Botanique, 54602 Villers-Lès-Nancy, France

    Olivier Bournez & Emmanuel Hainry

Authors
  1. Olivier Bournez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emmanuel Hainry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jérôme Durand-Lose Maurice Margenstern

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bournez, O., Hainry, E. (2007). On the Computational Capabilities of Several Models. In: Durand-Lose, J., Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2007. Lecture Notes in Computer Science, vol 4664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74593-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74593-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74592-1

  • Online ISBN: 978-3-540-74593-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation