Dealing with what is possible to compute and in what bounds. Covering simple linear problems up to NP-Hard problems.
More information
Subcategories 2
Related categories 2
Sites 7
Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.
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.
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.
Wikipedia article.
An online course on complexity.
Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.
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.
Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].
The CCA Network provides some useful information for researchers working in the field of computability and complexity in analysis.
