1. 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 June 3, 2011); longer version at (viewed May 27, 2011).
  2. Udi Boker & Nachum Dershowitz (2006): Comparing Computational Power. Logic Journal of the IGPL 14(5), pp. 633–648, doi:10.1007/978-3-540-78127-1.
  3. 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-642-15205-4_14. Available at (viewed Aug. 11, 2010).
  4. Stephen A. Cook & Robert A. Reckhow (1973): Time-Bounded Random Access Machines. Journal of Computer Systems Science 7, pp. 73–80, doi:10.1145/800152.804898. Available at (viewed June 3, 2011).
  5. Nachum Dershowitz (2012): The Generic Model of Computation. In: Proceedings of the Seventh International Workshop on Developments in Computational Models (DCM 2011, July 2012, Zurich, Switzerland), Electronic Proceedings in Theoretical Computer Science. Available at (viewed July 13, 2012).
  6. 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 Apr. 15, 2009).
  7. 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 Apr. 15, 2009).
  8. 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 Apr. 15, 2009).
  9. Ian Parberry (1986): Parallel Speedup of Sequential Machines: A Defense of Parallel Computation Thesis. SIGACT News 18(1), pp. 54–67, doi:10.1145/8312.8317.
  10. 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. Available at rewriting.pdf (viewed June 3, 2011).
  11. Comandure Seshadhri, Anil Seth & Somenath Biswas (2007): RAM Simulation of BGS Model of Abstract-State-Machines. Fundamenta Informaticae 77(1–2), pp. 175–185. Available at (viewed June 3, 2011).

Comments and questions to:
For website issues: