Dealing with what is possible to compute and in what bounds. Covering simple linear problems up to NP-Hard problems.
Subcategories 2
Related categories 2
Sites 7
Loading new listings for you to review...
- Interactive Computation Wikipedia article.
- 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 and Complexity An online course on complexity.
- Church-Turing Thesis Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.
- Problem Solving Environments Home Page This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.
- 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].