Computability Logic and Foundations Math
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.
Top: Science: Math: Logic and Foundations: Computability
See Also:
- Bibliographic Database for Computability Theory - Extensive bibliography on computability and recursion theory, maintained by Peter computability Cholak.
- Interactive Computation - Wikipedia article.
- Church-Turing Thesis - Alonzo Church and Alan Turing formulated the thesis that computability logic and foundations coincides with recursivity; by Jack Copeland.
- Introduction to Logic and Recursion Theory - Notes from the class taught by Prof. Sacks computability in the Spring of 1998.
- Hypercomputation Research Network - The study of computation beyond that defined by computability the Turing machine, also known as super-Turing, non-standard computability or non-recursive computation. Links to people, resources computability and discussions.
- Open Questions in Recursion Theory - Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].
- Computability and Complexity in Analysis Network - The CCA Network provides some useful information for logic and foundations logic and foundations researchers working in the field of computability and logic and foundations logic and foundations complexity in analysis.
- Computability Theory - Directory of researchers working in computability theory, and list of open problems.
- Computability and Complexity - An online course on complexity.
- Problem Solving Environments Home Page - This site contains information about Problem Solving Environments math (PSEs), research, logic and foundations publications, and information on topics related math to PSEs.
MySQL - Cache Direct
