Directory of Computability Resources

Home > Science > Math > Logic and Foundations > Computability

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

Subcategories

• Asynchronous Computability
• Quantum Computing

Resources in This Category

• Church-Turing Thesis

  http://plato.stanford.edu/entries/church-turing/
  Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.

• Computability and Complexity

  http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html
  An online course on complexity.

• Computability and Complexity in Analysis Network

  http://cca-net.de/
  The CCA Network provides some useful information for researchers working in the field of computability and complexity in analysis.

• Hypercomputation Research Network

  http://www.hypercomputation.net/
  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

  http://en.wikipedia.org/wiki/Interactive_computation
  Wikipedia article.

• Open Questions in Recursion Theory

  http://math.berkeley.edu/~slaman/qrt/
  Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].

• Problem Solving Environments Home Page

  http://www-cgi.cs.purdue.edu/cgi-bin/acc/pses.cgi
  This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.

Related Categories

• Home > Computers > Computer Science
• Home > Computers > Computer Science > Theoretical > Complexity Theory

 

Home > Science > Math > Logic and Foundations > Computability

 

---

 

Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us