Mike Barnett & Wolfram Schulte (2001):
The ABCs of Specification: AsmL, Behavior, and Components.
Informatica (Slovenia) 25(4),
pp. 517–526.
Available at http://research.microsoft.com/pubs/73061/TheABCsOfSpecification(Informatica2001).pdf (viewed June 7, 2009).
Andreas Blass, Nachum Dershowitz & Yuri Gurevich (2009):
When are Two Algorithms the Same?.
Bulletin of Symbolic Logic 15(2),
pp. 145–168,
doi:10.2178/bsl/1243948484.
Available at http://nachum.org/papers/WhenAreTwo.pdf (viewed Mar. 27, 2011).
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.
Springer,
Berlin, Germany,
pp. 140–154,
doi:10.1007/978-3-642-15205-4_14.
Available at http://nachum.org/papers/HangingAlgorithms.pdf (viewed May 27, 2011); longer version at http://nachum.org/papers/ExactExploration.pdf (viewed May 27, 2011).
Andreas Blass & Yuri Gurevich (2006):
Ordinary Interactive Small-Step Algorithms, Part I.
ACM Transactions on Computational Logic 7(2),
pp. 363–419,
doi:10.1145/1131313.1131320.
Available at http://tocl.acm.org/accepted/blass04.ps (viewed May 21, 2009).
Andreas Blass & Yuri Gurevich (2007):
Ordinary Interactive Small-Step Algorithms, Part II.
ACM Transactions on Computational Logic 8(3),
doi:10.1145/1243996.1243998.
Article 15. Available at http://tocl.acm.org/accepted/blass2.pdf (viewed May 21, 2009).
Andreas Blass & Yuri Gurevich (2007):
Ordinary Interactive Small-Step Algorithms, Part III.
ACM Transactions on Computational Logic 8(3),
doi:10.1145/1243996.1243999.
Article 16. Available at http://tocl.acm.org/accepted/250blass.pdf (viewed May 21, 2009).
Andreas Blass & Yuri Gurevich (2008):
Abstract State Machines Capture Parallel Algorithms: Correction and Extension.
ACM Transactions on Computation Logic 9(3),
doi:10.1145/1352582.1352587.
Article 19. Available at http://research.microsoft.com/en-us/um/people/gurevich/Opera/157-2.pdf (viewed Aug. 11, 2010).
Andreas Blass, Yuri Gurevich, Dean Rosenzweig & Benjamin Rossman (2007):
Interactive Small-Step Algorithms, Part I: Axiomatization.
Logical Methods in Computer Science 3(4),
doi:10.2168/LMCS-3(4:3)2007.
Paper 3. Available at http://research.microsoft.com/~gurevich/Opera/176.pdf (viewed June 5, 2009)..
Andreas Blass, Yuri Gurevich, Dean Rosenzweig & Benjamin Rossman (2007):
Interactive Small-Step Algorithms, Part II: Abstract State Machines and the Characterization Theorem.
Logical Methods in Computer Science 4(4),
doi:10.2168/LMCS-3(4:4)2007.
Paper 4. Available at http://arxiv.org/pdf/0707.3789v2 (viewed July 17, 2011)..
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.
Available at http://research.microsoft.com/en-us/um/people/gurevich/Opera/150.pdf (viewed July 13, 2011).
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 http://nachum.org/papers/ArbitraryDomains.pdf (viewed Aug. 11, 2010).
Udi Boker & Nachum Dershowitz (2010):
Three Paths to Effectiveness.
In: Andreas Blass, Nachum Dershowitz & Wolfgang Reisig: Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday,
Lecture Notes in Computer Science 6300.
Springer,
Berlin, Germany,
pp. 36–47,
doi:10.1007/978-3-642-15025-8_7.
Available at http://nachum.org/papers/ThreePathsToEffectiveness.pdf (viewed Aug. 11, 2010).
Egon Börger (2002):
The Origins and the Development of the ASM Method for High Level System Design and Analysis.
Journal of Universal Computer Science 8(1),
pp. 2–74,
doi:10.3217/jucs-008-01-0002.
Available at http://www.jucs.org/jucs_8_1/the_origins_and_the/Boerger_E.pdf (viewed June 17, 2009).
Egon Börger & Dean Rosenzweig (1995):
A Mathematical Definition of Full Prolog.
Science of Computer Programming 24,
pp. 249–286,
doi:10.1016/0167-6423(95)00006-E.
Available at ftp://www.eecs.umich.edu/groups/gasm/prolog.pdf (viewed July 17, 2011).
Olivier Bournez & Nachum Dershowitz (2010):
Foundations of Analog Algorithms.
In: Proceedings of the Third International Workshop on Physics and Computation (P&C),
Nile River, Egypt,
pp. 85–94.
Available at http://nachum.org/papers/Analog.pdf (viewed May 27, 2011).
Olivier Bournez, Nachum Dershowitz & Evgenia Falkovich (2012):
Towards an Axiomatization of Simple Analog Algorithms.
In: Manindra Agrawal, S. Barry Cooper & Angsheng Li: Proceedings of the 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012, Beijing, China),
Lecture Notes in Computer Science 7287.
Springer Verlag,
pp. 525–536.
Available at http://dx.doi.org/10.1007/978-3-642-29952-0_49.
Available at http://nachum.org/papers/SimpleAnalog.pdf (viewed July 11, 2012).
Nachum Dershowitz & Evgenia Falkovich (2011):
A Formalization and Proof of the Extended Church-Turing Thesis.
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 http://nachum.org/papers/ECCT.pdf (viewed July 15, 2011).
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 http://nachum.org/papers/Church.pdf (viewed Apr. 15, 2009).
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.
Andreas Glausch & Wolfgang Reisig (2009):
An ASM-Characterization of a Class of Distributed Algorithms.
In: Jean-Raymond Abrial & Uwe Glässer: Rigorous Methods for Software Construction and Analysis,
Lecture Notes in Computer Science 5115.
Springer,
Berlin,
pp. 50–64,
doi:10.1007/978-3-642-11447-2_4.
Available at http://www2.informatik.hu-berlin.de/top/download/publications/GlauschR2007_dagstuhl.pdf (viewed Aug. 11, 2010).
E. Mark Gold (1965):
Limiting Recursion.
J. Symbolic Logic 30(1),
pp. 28–48,
doi:10.2307/2270580.
Saul Gorn (1960):
Algorithms: Bisection Routine.
Communications of the ACM 3(3),
pp. 174,
doi:10.1145/367149.367173.
Erich Grädel & Antje Nowack (2003):
Quantum Computing and Abstract State Machines.
In: Proceedings of the 10th International Conference on Abstract State Machines: Advances in Theory and Practice (ASM '03; Taormina, Italy).
Springer-Verlag,
Berlin,
pp. 309–323,
doi:10.1007/3-540-36498-6_18.
Available at http://www.logic.rwth-aachen.de/pub/graedel/GrNo-asm03.ps (viewed July 13, 2011).
Yuri Gurevich (1995):
Evolving Algebras 1993: Lipari Guide.
In: Egon Börger: Specification and Validation Methods.
Oxford University Press,
pp. 9–36.
Available at http://research.microsoft.com/~gurevich/opera/103.pdf (viewed Apr. 15, 2009).
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 http://research.microsoft.com/~gurevich/opera/141.pdf (viewed Apr. 15, 2009).
Yuri Gurevich, Benjamin Rossman & Wolfram Schulte (2005):
Semantic Essence of AsmL.
Theoretical Computer Science 343(3),
pp. 370–412,
doi:10.1016/j.tcs.2005.06.017.
Available at http://research.microsoft.com/~gurevich/opera/169.pdf (viewed June 7, 2009).
Yuri Gurevich, Wolfram Schulte & Margus Veanes (2001):
Toward Industrial Strength Abstract State Machines.
Technical Report MSR-TR-2001-98.
Microsoft Research.
Available at http://research.microsoft.com/en-us/um/people/gurevich/opera/155.pdf (viewed Aug. 11, 2010).
Yuri Gurevich & Tatiana Yavorskaya (2006):
On Bounded Exploration and Bounded Nondeterminism.
Technical Report MSR-TR-2006-07.
Microsoft Research.
Available at http://research.microsoft.com/~gurevich/opera/177.pdf (viewed Apr. 15, 2009).
David Harel (1980):
On Folk Theorems.
Communications of the ACM 23(7),
pp. 379–389,
doi:10.1145/358886.358892.
Stephen C. Kleene (1967):
Mathematical Logic.
Wiley,
New York.
Stephen C. Kleene (1987):
Reflections on Church's Thesis.
Notre Dame Journal of Formal Logic 28(4),
pp. 490–498,
doi:10.1305/ndjfl/1093637645.
Emil L. Post (1994):
Absolutely Unsolvable Problems and Relatively Undecidable Propositions: Account of an Anticipation.
In: M. Davis: Solvability, Provability, Definability: The Collected Works of Emil L. Post.
Birkhaüser,
Boston, MA,
pp. 375–441.
Unpublished paper, 1941.
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.
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 http://www2.informatik.hu-berlin.de/top/download/publications/Reisig2003_ai395.pdf (viewed Aug. 11, 2010).
Wolfgang Reisig (2008):
The Computable Kernel of Abstract State Machines.
Theoretical Computer Science 409(1),
pp. 126–136,
doi:10.1016/j.tcs.2008.08.041.
Draft available at http://www2.informatik.hu-berlin.de/top/download/publications/Reisig2004_hub_tr177.pdf (viewed Aug. 11, 2010).
Hartley Rogers, Jr. (1966):
Theory of Recursive Functions and Effective Computability.
McGraw-Hill,
New York.
Marc Spielmann (2000):
Abstract State Machines: Verification Problems and Complexity.
Ph.D. thesis.
RWTH Aachen,
Aachen, Germany.
Available at http://www-mgi.informatik.rwth-aachen.de/~spielmann/diss.pdf (viewed July 13, 2011).
Alan M. Turing (1936–37):
On Computable Numbers, With an Application to the Entscheidungsproblem.
Proceedings of the London Mathematical Society 42,
pp. 230–265,
doi:10.1112/plms/s2-42.1.230.
Corrections in vol. 43 (1937), pp. 544-546. Reprinted in M. Davis (ed.),ıt The Undecidable, Raven Press, Hewlett, NY, 1965. Available at http://www.abelard.org/turpap2/tp2-ie.asp.
eptcs@eptcs.org