Web Directory

» Bibliographic Database for Computability Theory
   Extensive bibliography on computability and recursion theory, maintained by Peter Cholak.
   http://www.nd.edu/~cholak/computability/bib/bib.html

» Church-Turing Thesis
   Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.
   http://plato.stanford.edu/entries/church-turing/

» Computability Theory
   Directory of researchers working in computability theory, and list of open problems.
   http://www.nd.edu/~cholak/computability/computability.html

» Computability and Complexity
   An online course on complexity.
   http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html

» Computability and Complexity in Analysis Network
   The CCA Network provides some useful information for researchers working in the field of computability and complexity in analysis.
   http://cca-net.de/

» Hypercomputation Research Network
   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.
   http://www.hypercomputation.net/

» Interactive Computation
   Wikipedia article.
   http://en.wikipedia.org/wiki/Interactive_computation

» Open Questions in Recursion Theory
   Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].
   http://math.berkeley.edu/~slaman/qrt/

» Problem Solving Environments Home Page
   This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.
   http://www-cgi.cs.purdue.edu/cgi-bin/acc/pses.cgi