HubHip: Science: Math: Logic and Foundations: Computability (11)

Dealing with what is possible to compute and in what bounds. Covering simple linear problems up to NP-Hard problems.

Computability

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