Dealing with what is possible to compute and in what bounds. Covering simple linear problems up to NP-Hard problems....
This page was last updated on August 23rd, 2008
This page was last updated on August 23rd, 2008
Computability (from Logic and Foundations)
Canadian Content » Science » Math » Logic_and_Foundations » Computability »
Computability Theory
Directory of researchers working in computability theory, and list of open problems.
Computability Logic - Wictionary
A dictionary definition of the subject.
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.
Bibliographic Database for Computability Theory
Extensive bibliography on computability and recursion theory, maintained by Peter Cholak.
Introduction to Logic and Recursion Theory
Notes from the class taught by Prof. Sacks in the Spring of 1998.
Interactive Computation
Wikipedia article.
Problem Solving Environments Home Page
This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.
Open Questions in Recursion Theory
Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].
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.
ECCC - Electronic Colloquium on Computational Complexity
The Electronic Colloquium on Computational Complexity is a new forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. The Electronic Colloquium on Computational Complexity (ECCC) welcomes papers, s
Computability Logic
Encyclopedia article.
Directory of researchers working in computability theory, and list of open problems.
A dictionary definition of the subject.
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.
Extensive bibliography on computability and recursion theory, maintained by Peter Cholak.
Introduction to Logic and Recursion TheoryNotes from the class taught by Prof. Sacks in the Spring of 1998.
Wikipedia article.
This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.
Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].
An online course on complexity.
Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.
The Electronic Colloquium on Computational Complexity is a new forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. The Electronic Colloquium on Computational Complexity (ECCC) welcomes papers, s
Encyclopedia article.
Logic and Foundations >> Computability yielded other results on Canadian Content:
The Science of Free Will
February 25th, 2008, 09:44 AM Gerryh While not one of your brainier folk, I'd offer the observation
February 25th, 2008, 09:44 AM Gerryh While not one of your brainier folk, I'd offer the observation
|
 |
-
