-
Extensive bibliography on computability and recursion theory, maintained by Peter Cholak.
-
A dictionary definition of the subject.
-
Information on this site includes a Bibliographic Database for Computability Theory, a list of Open Questions in Recursion Theory as well as links to many researchers working in the field. Maintained by Peter Cholak.
-
An online course on complexity.
-
The CCA Network provides some useful information for researchers working in the field of computability and complexity in analysis.
-
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.
-
Wikipedia article.
-
Notes from the class taught by Prof. Sacks in the Spring of 1998.
-
Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].
-
This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.
-
Article from the Stanford Encyclopedia.
