| Bibliographic Database for Computability Theory: Extensive bibliography on computability and recursion theory, maintained by Peter Cholak. |
| Church-Turing Thesis: Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland. |
| Computability and Complexity: An online course on complexity. |
| 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. |
| Computability Logic: Encyclopedia article. |
| Computability Logic - Wictionary: A dictionary definition of the subject. |
| Computability Theory: Directory of researchers working in computability theory, and list of open problems. |
| ECCC - Electronic Colloquium on Computational Complexity: 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 |
| 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. |
| Interactive Computation: Wikipedia article. |
| Introduction to Logic and Recursion Theory: Notes from the class taught by Prof. Sacks in the Spring of 1998. |
| Open Questions in Recursion Theory: Compiled by Theodore A. Slaman, Berkeley [TeX/PDF]. |
| Problem Solving Environments Home Page: This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs. |
Classical
