Active Bibliography

2 Historical Projects in Discrete Mathematics and Computer Science – Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
33 Computability and recursion – Robert I. Soare - 1996
4 Alan Turing and the Mathematical Objection – Gualtiero Piccinini - 2003
2 A natural axiomatization of Church’s thesis – Nachum Dershowitz, Yuri Gurevich - 2007
5 The history and concept of computability – Robert I. Soare - 1999
3 Computability and Incomputability – Robert I. Soare
4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
Arithmetic and the Incompleteness Theorems – Richard W. Kaye - 2000
5 Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems – Keiichirou Kusakari - 2000
Global semantic typing for inductive and coinductive computing – Daniel Leivant
19 Algorithms: A quest for absolute definitions – Andreas Blass, Yuri Gurevich - 2003
21 A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS – Nachum Dershowitz, Yuri Gurevich
Lambda-Calculus and Functional Programming – Jonathan P. Seldin
1 Kleene’s Amazing Second Recursion Theorem (Extended Abstract) – Yiannis N. Moschovakis
12 The Church-Turing Thesis over Arbitrary Domains – Udi Boker, Nachum Dershowitz - 2008
1 Comparative Analysis of Hypercomputational Systems Submitted in partial fulfilment – Mariam Kiran, Supervisor Dr Mike Stannett
11 Notions of computability at higher types I – John Longley - 2005
1 Information processing, computation, and cognition – Gualtiero Piccinini, Andrea Scarantino
Extensions, Automorphisms, and Definability – Robert I. Soare