Bibliographic Database for Computability Theory - http://www.nd.edu/~cholak/computability/bib/bib.html
Extensive bibliography on computability and recursion theory, maintained by Peter Cholak. |
Church-Turing Thesis - http://plato.stanford.edu/entries/church-turing/
Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland. |
Computability and Complexity - http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html
An online course on complexity. |
Computability and Complexity in Analysis Network - http://www.cca-net.de/
The CCA Network provides some useful information for researchers working in the field of computability and complexity in analysis. |
Computability Theory - http://www.nd.edu/~cholak/computability/computability.html
Directory of researchers working in computability theory, and list of open problems. |
Hypercomputation Research Network - http://www.hypercomputation.net/
The study of computation beyond that defined by the Turing machine, also known as super-Turing, non-standard or non-recursive computation. Links to people, resources and discussions. |
Interactive Computation - http://en.wikipedia.org/wiki/Interactive_computation
Wikipedia article. |
Introduction to Logic and Recursion Theory - http://www.media.mit.edu/physics/pedagogy/babbage/texts/rt.html
Notes from the class taught by Prof. Sacks in the Spring of 1998. |
Open Questions in Recursion Theory - http://math.berkeley.edu/~slaman/qrt/
Compiled by Theodore A. Slaman, Berkeley [TeX/PDF]. |
Problem Solving Environments Home Page - http://www-cgi.cs.purdue.edu/cgi-bin/acc/pses.cgi
This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs. |