205

A Basis for a Mathematical Theory of Computation
– John Mccarthy
 1963

23

What Is an Algorithm?
– Yiannis N. Moschovakis
 2000

9

A mathematical modeling of pure, recursive algorithms
– Yiannis N Moschovakis
 1989

21

The formal language of recursion
– Yiannis N Moschovakis
 1989

690

Introduction to metamathematics, D
– S C Kleene
 1952

30

Foundations of Recursion Theory
– R Platek

6

Turing. On computable numbers, with an application to the Entscheidungsproblem
– Alan Mathison

12

Moschovakis. Recursion in higher types
– A S Kechris, Y N
 1977

5

Inductive schemata and recursively continuous functionals
– S Feferman
 1977

6

Recursive functionals of finite type
– S C Kleene
 1963

8

Combinatorial lower bound arguments for deterministic and nondeterministic turing machines
– Wolfgang Maass
 1985

2

Sequential abstract machines capture sequential algoriths
– Yuri Gurevich

2

A gametheoretic, concurrent anf fair model of the typed lambdacalculus, with full recursion
– Yiannis N Moschovakis
 1998

2

What is an algorithm? To appear
– Yiannis N Moschovakis
 2000

169

Elementary Induction on Abstract Structures
– Y Moschovakis
 1974

69

The Formal Semantics of Programming Languages. Foundation of Computing Series
– G Winskel
 1993

2190

The Art of Computer Programming
– Donald Knuth
 1973

128

toward a mathematical semantics for computer languages
– Dana Scott, Christopher Strachey

395

LCF considered as a programming language
– G Plotkin
 1977
