6

N.: Comparing computational power
– Udi Boker, Nachum Dershowitz

18

Recursion Theory
– Joseph R Shoenfield

93

Computability and Complexity from a Programming Perspective. Foundations of Computing
– Neil D Jones
 1997

265

An unsolvable problem of elementary number theory
– A Church
 1936

21

Why Gödel Didn't Have Church's Thesis
– M Davis
 1982

15

An Abstract Model for Parallel Computations: Gandy’s Thesis’, The Monist 82
– W Sieg, J Byrnes
 1999

115

Sequential abstract state machines capture sequential algorithms
– Yuri Gurevich

15

Gandy Machines
– Reserve “Background
 2000

119

The art of computer programming. Volume 1
– D E Knuth
 1997

56

Church’s thesis and principles for mechanism, in
– R Gandy
 1980

7

Towards a general theory of computability
– R Montague

6

A two counter machine cannot calculate 2 n
– R Schroeppel
 1972

11

The Theory of Computability
– Rudolph Sommerhalder, S C van Westrhenen
 1988

11

Some philosophical implications of mathematical logic. Three classes of ideas. Rev Metaphys 6
– J Myhill
 1952

7

Acceptable notation. Notre Dame
– S Shapiro
 1982

456

Computation: Finite and Infinite Machines
– M Minsky
 1967

838

Theory of Recursive Functions and Effective Computability
– H Rogers
 1967

119

Computability: An Introduction to Recursive Function Theory
– N J Cutland
 1986

44

Recursive predicates and quantifiers
– S C Kleene
 1943
