Dealing with what is possible to compute and in what bounds. Covering simple linear problems up to NP-Hard problems.
Related categories 2
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.
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.
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.
Last update:February 25, 2016 at 6:15:06 UTC