1. Pablo Arrighi & Gilles Dowek (2013): Causal Graph Dynamics. Information and Computation 223, pp. 78–93, doi:10.1007/978-3-642-31585-5_9. Available at (viewed February 15, 2014).
  2. Andreas Blass, Nachum Dershowitz & Yuri Gurevich (2010): Exact Exploration and Hanging Algorithms. In: Proceedings of the 19th EACSL Annual Conferences on Computer Science Logic (Brno, Czech Republic), Lecture Notes in Computer Science 6247. Springer, Berlin, Germany, pp. 140–154, doi:10.1007/978-3-642-15205-4_14. Available at (viewed February 15, 2015); longer version at (viewed February 15, 2015).
  3. Andreas Blass, Yuri Gurevich & Saharon Shelah (1999): Choiceless Polynomial Time. Annals of Pure and Applied Logic 100, pp. 141–187, doi:10.1016/S0168-0072(99)00005-6.
  4. Andreas Blass, Yuri Gurevich & Saharon Shelah (2002): On Polynomial Time Computation Over Unordered Structures. Journal of Symbolic Logic 67:3, pp. 1093–1125, doi:10.2178/jsl/1190150152.
  5. Udi Boker & Nachum Dershowitz (2008): The Church-Turing Thesis over Arbitrary Domains. In: Arnon Avron, Nachum Dershowitz & Alexander Rabinovich: Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, Lecture Notes in Computer Science 4800. Springer, pp. 199–229, doi:10.1007/978-3-540-78127-1_12. Available at (viewed February 15, 2015).
  6. Nachum Dershowitz (2012): The Generic Model of Computation. Electronic Proceedings in Theoretical Computer Science, doi:10.4204/EPTCS.88.5. Available at (viewed February 13, 2013).
  7. Nachum Dershowitz & Evgenia Falkovich (2011): A Formalization and Proof of the Extended Church-Turing Thesis. In: E. Kashefi, J. Krivine & F. van Raamsdonk: Proceedings of the Seventh International Workshop on Developments in Computational Models (DCM 2011), EPTCS 88, Zurich, Switzerland, pp. 72–78, doi:10.4204/EPTCS.88.6. Available at (viewed February 15, 2015).
  8. Nachum Dershowitz & Evgenia Falkovich (2014): The Invariance Thesis. Submitted. Available at (viewed February 15, 2015).
  9. Nachum Dershowitz & Yuri Gurevich (2008): A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14(3), pp. 299–350, doi:10.2178/bsl/1231081370. Available at (viewed February 15, 2015).
  10. Gilles Dowek (2012): The Physical Church Thesis as an Explanation of the Galileo Thesis. Natural Computing 11(2), pp. 247–251, doi:10.1007/s11047-011-9301-x.
  11. Robin Gandy (1980): Church's Thesis and Principles for Mechanisms. In: The Kleene Symposium, Studies in Logic and the Foundations of Mathematics 101. North-Holland, pp. 123–148, doi:10.1016/S0049-237X(08)71257-6.
  12. E. Mark Gold (1965): Limiting Recursion. J. Symbolic Logic 30(1), pp. 28–48, doi:10.2307/2270580.
  13. Yuri Gurevich (1995): Evolving Algebras 1993: Lipari Guide. In: Egon Börger: Specification and Validation Methods. Oxford University Press, pp. 9–36. Available at (viewed February 15, 2015).
  14. Yuri Gurevich (2000): Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic 1(1), pp. 77–111, doi:10.1145/343369.343384. Available at (viewed February 15, 2015).
  15. John von Neumann & Arthur W. Burks (1966): Theory of Self-Reproducing Automata. University of Illinois Press, Urbana, IL. One chapter available at (viewed Febraury 15, 2015).
  16. Detlef Plump (1999): Term Graph Rewriting. In: H. Ehrig, G. Engels, H.-J. Kreowski & G. Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformation: Applications, Languages and Tools, chapter 1 volume 2. World Scientific, pp. 3–61, doi:10.1142/9789812815149_0001. Available at (viewed February 15, 2015).
  17. Hilary Putnam (1965): Trial and Error Predicates and the Solution to a Problem of Mostowski. J. Symbolic Logic 30(1), pp. 49–57, doi:10.2307/2270581.
  18. Wolfgang Reisig (2003): On Gurevich's Theorem on Sequential Algorithms. Acta Informatica 39(4), pp. 273–305, doi:10.1007/s00236-002-0106-3. Available at (viewed February 15, 2015).

Comments and questions to:
For website issues: