| submit a site to this category |
|   |
| Subcategories | |
|---|---|
| Asynchronous Computability@ | Quantum Computing@ |
|
|
Interactive ComputationURL: http://en.wikipedia.org/wiki/Interactive_computation ODP description: Wikipedia article. Page title: Interactive computation - Wikipedia, the free encyclopedia ![]() |
|
|
Open Questions in Recursion TheoryURL: http://math.berkeley.edu/~slaman/qrt/ ODP description: Compiled by Theodore A. Slaman, Berkeley [TeX/PDF]. Page title: Theodore A. Slaman: Homepage ![]() |
|
|
Introduction to Logic and Recursion TheoryURL: http://www.media.mit.edu/physics/pedagogy/babbage/texts/rt.html ODP description: Notes from the class taught by Prof. Sacks in the Spring of 1998. Page title: Logic, 8 ![]() |
|
|
Church-Turing ThesisURL: http://plato.stanford.edu/entries/church-turing/ ODP description: Jack Copeland of the University of Canterbury, New Zealand outlines this frequently misunderstood thesis. Page title: The Church-Turing Thesis (Stanford Encyclopedia of Philosophy) ![]() |
|
|
Computability and ComplexityURL: http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html ODP description: An online course on complexity. ![]() |
|
|
Problem Solving Environments Home PageURL: http://www-cgi.cs.purdue.edu/cgi-bin/acc/pses.cgi ODP description: This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs. Page title: Problem Solving Environments Home Page Page description: A PSE is a computer system that provides all the computational facilities needed to solve a target class of problems. The PSEs research group in the Computer Sciences Department at Purdue University provides a home page with information about PSE software. ![]() |
|
|
Computability and Complexity in Analysis NetworkURL: http://www.cca-net.de/ ODP description: The CCA Network provides some useful information for researchers working in the field of computability and complexity in analysis. Page title: Computability and Complexity in Analysis - Network ![]() |
|
|
Computability TheoryURL: http://www.nd.edu/~cholak/computability/computability.html ODP description: Information on this site includes a Bibliographic Database for Computability Theory, a list of Open Questions in Recursion Theory as well as links to many researchers working in the field. Maintained by Peter Cholak. ![]() |
|
|
Hypercomputation Research NetworkURL: http://www.hypercomputation.net/ ODP description: 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. Page title: Home Page - Hypercomputation Research Network (http://hypercomputation.net) ![]() |
|
|
Computability Logic - WictionaryURL: http://en.wiktionary.org/wiki/Computability_logic ODP description: A dictionary definition of the subject. Page title: computability logic - Wiktionary ![]() |
|
|
Bibliographic Database for Computability TheoryURL: http://www.nd.edu/~cholak/computability/bib/bib.html ODP description: Extensive bibliography on computability and recursion theory, maintained by Peter Cholak. Page title: A Bibliographic Database for Computably Theory ![]() |
|
| |