The Electronic Colloquium on Computational Complexity is a new forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. The Electronic Colloquium on Computational Complexity (ECCC) welcomes papers, short notes and surveys with relevance to the theory of computation
Directory of researchers working in computability theory, and list of open problems.
Extensive bibliography on computability and recursion theory, maintained by Peter Cholak.
An online course on complexity.
This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.
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.
Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.
Notes from the class taught by Prof. Sacks in the Spring of 1998.