Historical Projects in Discrete Mathematics and Computer Science

by Janet Barnett , Guram Bezhanishvili , Hing Leung , Jerry Lodder , David Pengelley , Desh Ranjan
Citations:2 - 1 self

Active Bibliography

32 Computability and recursion – Robert I. Soare - 1996
Church’s Thesis – Guram Bezhanishvili
5 The history and concept of computability – Robert I. Soare - 1999
4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
4 Alan Turing and the Mathematical Objection – Gualtiero Piccinini - 2003
A Study of Logic and Programming via Turing Machines – Jerry M. Lodder
18 Higher Order Logic – Daniel Leivant - 1994
2 A natural axiomatization of Church’s thesis – Nachum Dershowitz, Yuri Gurevich - 2007
Lambda-Calculus and Functional Programming – Jonathan P. Seldin
development of computer science – J. Díaz C. Torras
A personal account of Turing’s imprint on the development of computer science – J. Díaz, C. Torras
3 Computability and Incomputability – Robert I. Soare
11 Notions of computability at higher types I – John Longley - 2005
5 Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems – Keiichirou Kusakari - 2000
5 How much can analog and hybrid systems be proved (super-)Turing – Olivier Bournez - 2006
Effectiveness ∗ – Nachum Dershowitz, Evgenia Falkovich, Gleichung Eine, Diophantische Gleichung - 2011
UNDECIDABLE PROBLEMS: A SAMPLER – Bjorn Poonen
5 Are There New Models of Computation? Reply to Wegner and Eberbach – Paul Cockshott, Greg Michaelson - 2005
1 Comparative Analysis of Hypercomputational Systems Submitted in partial fulfilment – Mariam Kiran, Supervisor Dr Mike Stannett