8

Prospects for mathematical logic in the twentyfirst century
– Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore
 2002

7

Towards a general theory of computability
– R Montague

21

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

18

Recursion Theory
– Joseph R Shoenfield

6

Collected Works
– K Gödel
 1986

4

O ponyatii algoritma [On the concept of algorithm], Uspekhi Matematicheskikh Nauk [Russian Mathematical Surveys
– Andreĭ N Kolmogorov
 1953

690

Introduction to metamathematics, D
– S C Kleene
 1952

1161

On computable numbers with an application to the Entscheidungsproblem
– A Turing
 1936

265

An unsolvable problem of elementary number theory
– A Church
 1936

115

Sequential abstract state machines capture sequential algorithms
– Yuri Gurevich

3

Gandy’s principles for mechanisms and membrane computing
– A Obtulowicz

2

Computability Theory. Seminar Lectures
– W Sieg
 2004

2

The Complexity of Computation on
– F Fich
 1993

2

Quantum Energy–based P Systems
– Alberto Leporati, Dario Pescini, Claudio Z

1

An analytic condition for
– J F Costa, J Mycka
 2006

1

The conjecture P = NP presented by means of some class of real functions
– J F Costa, J Mycka
 2007

1

Gandy’s principles for mechanisms as a model for parallel computation, in: The Universal Turing Machine: a HalfCentury Survey
– E Dahlhaus, J A Makowsky
 1995

1

Looking to the Future, talk given at CiE
– D S Scott
 2007

5

Probabilistic P systems
– A Obtulowicz
