1

What is computation? Ubiquity
– P Denning
 2010

32

Beyond Turing Machines
– Eugene Eberbach, Peter Wegner

63

Computation Beyond the Turing Limit
– H T Siegelmann
 1995

8

On computable numbers, with an application to the Etscheidungs problem
– A Turing
 1936

4

Inexhaustibility: A nonexhaustive treatment
– T Franzen
 2004

2

Zur Hilbertsche Beweistheorie
– J von Neumann
 1927

1

p.welch@bristol.ac.uk] is Professor of mathematical logic at the University of Bristol. From 1997 to 2000 he was Professor of mathematical logic at the graduate school, Kobe University, setting up a new research group in set theory. He has held a Mercator
– Philip Welch

1

Scope: The Rendiconti del Seminario Matematico della UniversitĂ di Padova have been published by the Seminario Matematico of the University of Padua since 1930. The aim of Rendiconti is to publish original highquality research articles in mathematics. By
– Aims

20

Alan Turing: The Enigma, Simon and
– A Hodges
 1983

13

The confluence of Ideas in 1936
– R Gandy
 1988

731

Computing machinery and intelligence
– A Turing
 1950

66

The Undecidable
– Martin Davis, ed
 1965

102

A Note on the Entscheidungsproblem
– A Church
 1936

125

System of logics based on ordinals
– A M Turing
 1939

1

Turingâ€™s Thesis
– Solomon Feferman

8

Beyond Turing Machines. The Bulletin of the European Association for Theoretical Computer
– E Eberbach, P Wegner
 2003

6

Computation beyond Turing Machines: Seeking appropriate methods to model computing and human thought
– P Wegner, D Goldin
 2003

5

Papers of John von Neumann on Computing and Computer Theory
– W Aspray, A Burks
 1989

2

Systems of logic defined by ordinals
– A M Turing
 1939
