Algorithms: A quest for absolute definitions (2003)

by Andreas Blass , Yuri Gurevich
Venue:Bulletin of the European Association for Theoretical Computer Science
Citations:19 - 9 self

Documents Related by Co-Citation

115 Sequential abstract state machines capture sequential algorithms – Yuri Gurevich
58 Abstract state machines capture parallel algorithms – Andreas Blass, Yuri Gurevich - 2003
31 Ordinary Interactive Small-Step Algorithms – Andreas Blass, Yuri Gurevich - 2004
8 On the concept of algorithm”, Uspekhi Mat. Nauk 8:4 – Andrei N Kolmogorov - 1953
265 An unsolvable problem of elementary number theory – A Church - 1936
1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
405 Evolving Algebras 1993: Lipari Guide – Yuri Gurevich - 1995
23 What Is an Algorithm? – Yiannis N. Moschovakis - 2000
21 A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS – Nachum Dershowitz, Yuri Gurevich
52 On the definition of an algorithm – A N Kolmogorov, V A Uspenskii - 1958
7 General Interactive Small-Step Algorithms – Andreas Blass , Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman - 2005
7 webpage, http://www.eecs.umich.edu/gasm/, maintained by James K – ASM Michigan
67 Evolving Algebras 1993: Lipari Guide, Specification and Validation – Y Gurevich - 1995
13 Kolmogorov and mathematical logic – V Uspensky - 1992
213 Abstract State Machines: A Method for High-Level System Design and Analysis – Egon Börger - 2003
66 The Undecidable – Martin Davis, ed - 1965
7 E ective computation by humans and machines – O Shagrir
22 Choiceless Polynomial Time – Andreas Blass, Yuri Gurevich, Saharon Shelah - 2000
2 Moschovakis 2001. What is an algorithm – N Yiannis - 1999