<bibliography>
 <citation type="inproceedings" key="Exact">
  <author>Andreas Blass</author>
  <author>Nachum Dershowitz</author>
  <author>Yuri Gurevich</author>
  <year>2010</year>
  <title>Exact Exploration and Hanging Algorithms</title>
  <booktitle>Proceedings of the 19th EACSL Annual Conferences on Computer Science Logic (Brno, Czech Republic)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>6247</volume>
  <publisher>Springer</publisher>
  <address>Berlin, Germany</address>
  <pages>140&#8211;154</pages>
  <doi>10.1007/978-3-642-15205-4_14</doi>
  <note>Available at http://nachum.org/papers/HangingAlgorithms.pdf (viewed June 3, 2011); longer version at http://nachum.org/papers/ExactExploration.pdf (viewed May 27, 2011)</note>
 </citation>
 <citation type="article" key="Simulation">
  <author>Udi Boker</author>
  <author>Nachum Dershowitz</author>
  <year>2006</year>
  <title>Comparing Computational Power</title>
  <journal>Logic Journal of the IGPL</journal>
  <volume>14</volume>
  <number>5</number>
  <pages>633&#8211;648</pages>
  <doi>10.1007/978-3-540-78127-1</doi>
 </citation>
 <citation type="incollection" key="CT_ASM">
  <author>Udi Boker</author>
  <author>Nachum Dershowitz</author>
  <year>2008</year>
  <title>The Church-Turing Thesis over Arbitrary Domains</title>
  <editor>Arnon Avron</editor>
  <editor>Nachum Dershowitz</editor>
  <editor>Alexander Rabinovich</editor>
  <booktitle>Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>4800</volume>
  <publisher>Springer</publisher>
  <pages>199&#8211;229</pages>
  <doi>10.1007/978-3-642-15205-4_14</doi>
  <note>Available at http://nachum.org/papers/ArbitraryDomains.pdf (viewed Aug. 11, 2010)</note>
 </citation>
 <citation type="article" key="RAM">
  <author>Stephen A. Cook</author>
  <author>Robert A. Reckhow</author>
  <year>1973</year>
  <title>Time-Bounded Random Access Machines</title>
  <journal>Journal of Computer Systems Science</journal>
  <volume>7</volume>
  <pages>73&#8211;80</pages>
  <doi>10.1145/800152.804898</doi>
  <note>Available at http://www.cs.berkeley.edu/~christos/classics/Deutsch_quantum_theory.pdf (viewed June 3, 2011)</note>
 </citation>
 <citation type="inproceedings" key="Generic">
  <author>Nachum Dershowitz</author>
  <year>2012</year>
  <title>The Generic Model of Computation</title>
  <booktitle>Proceedings of the Seventh International Workshop on Developments in Computational Models (DCM 2011, July 2012, Zurich, Switzerland)</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <note>Available at http://nachum.org/papers/Generic.pdf (viewed July 13, 2012)</note>
 </citation>
 <citation type="article" key="BSL">
  <author>Nachum Dershowitz</author>
  <author>Yuri Gurevich</author>
  <year>2008</year>
  <title>A Natural Axiomatization of Computability and Proof of Church's Thesis</title>
  <journal>Bulletin of Symbolic Logic</journal>
  <volume>14</volume>
  <number>3</number>
  <pages>299&#8211;350</pages>
  <doi>10.2178/bsl/1231081370</doi>
  <note>Available at http://nachum.org/papers/Church.pdf (viewed Apr. 15, 2009)</note>
 </citation>
 <citation type="incollection" key="Lipari">
  <author>Yuri Gurevich</author>
  <year>1995</year>
  <title>Evolving Algebras 1993: Lipari Guide</title>
  <editor>Egon B&#246;rger</editor>
  <booktitle>Specification and Validation Methods</booktitle>
  <publisher>Oxford University Press</publisher>
  <pages>9&#8211;36</pages>
  <note>Available at http://research.microsoft.com/~gurevich/opera/103.pdf (viewed Apr. 15, 2009)</note>
 </citation>
 <citation type="article" key="ASM-Theorem-Gurevich">
  <author>Yuri Gurevich</author>
  <year>2000</year>
  <title>Sequential Abstract State Machines Capture Sequential Algorithms</title>
  <journal>ACM Transactions on Computational Logic</journal>
  <volume>1</volume>
  <number>1</number>
  <pages>77&#8211;111</pages>
  <doi>10.1145/343369.343384</doi>
  <note>Available at http://research.microsoft.com/~gurevich/opera/141.pdf (viewed Apr. 15, 2009)</note>
 </citation>
 <citation type="article" key="Parberry">
  <author>Ian Parberry</author>
  <year>1986</year>
  <title>Parallel Speedup of Sequential Machines: A Defense of Parallel Computation Thesis</title>
  <journal>SIGACT News</journal>
  <volume>18</volume>
  <number>1</number>
  <pages>54&#8211;67</pages>
  <doi>10.1145/8312.8317</doi>
 </citation>
 <citation type="incollection" key="TermGraph">
  <author>Detlef Plump</author>
  <year>1999</year>
  <title>Term Graph Rewriting</title>
  <editor>H. Ehrig</editor>
  <editor>G. Engels</editor>
  <editor>H.-J. Kreowski</editor>
  <editor>G. Rozenberg</editor>
  <booktitle>Handbook of Graph Grammars and Computing by Graph Transformation: Applications, Languages and Tools</booktitle>
  <chapter>1</chapter>
  <volume>volume 2</volume>
  <publisher>World Scientific</publisher>
  <pages>3&#8211;61</pages>
  <doi>10.1142/9789812815149</doi>
  <note>Available at http://www.informatik.uni-bremen.de/agbkb/lehre/rbs/texte/Termgraph rewriting.pdf (viewed June 3, 2011)</note>
 </citation>
 <citation type="article" key="dagRepr">
  <author>Comandure Seshadhri</author>
  <author>Anil Seth</author>
  <author>Somenath Biswas</author>
  <year>2007</year>
  <title>RAM Simulation of BGS Model of Abstract-State-Machines</title>
  <journal>Fundamenta Informaticae</journal>
  <volume>77</volume>
  <number>1&#8211;2</number>
  <pages>175&#8211;185</pages>
  <note>Available at http://www.cse.iitk.ac.in/users/sb/papers/asm2ram.pdf (viewed June 3, 2011)</note>
 </citation>
</bibliography>
