How to compare the power of computational models

How to compare the power of computational models (2005)

by Udi Boker , Nachum Dershowitz

Venue:	In Computability in Europe 2005: New Computational Paradigms
Citations:	3 - 3 self

18	Why Gödel didn’t have Church’s Thesis – M Davis - 1982
5	N.: Comparing computational power – U Boker, Dershowitz
12	An abstract model for parallel computation: Gandy’s thesis – W Sieg, J Byrnes - 1998
13	Recursion theory – J R Shoenfield - 1993
79	Computability and Complexity From a Programming Perspective – N D Jones - 1997
214	An unsolvable problem of elementary number theory – A Church - 1936
104	Sequential abstract state machines capture sequential algorithms – Yuri Gurevich
15	Gandy Machines – Reserve “Background - 2000
43	Church’s Thesis and Principles for Mechanisms – R Gandy - 1980
108	The art of computer programming. Volume 1 – D E Knuth - 1997
10	The Theory of Computability – R Sommerhalder, S C van Westrhenen - 1988
5	Acceptable notation. Notre Dame – S Shapiro - 1982
9	Some philosophical implications of mathematical logic I. Three classes of ideas – J Myhill - 1952
7	Towards a general theory of computability – R Montague
6	A two counter machine cannot calculate 2 n – R Schroeppel - 1972
33	Recursive predicates and quantifiers – Stephen Cole Kleene - 1943
97	Systems of Logic Based on Ordinals – A M Turing - 1939
98	Computability: An introduction to recursive function theory – N Cutland - 1980
352	Computation: Finite and Infinite Machines – M Minsky - 1967