Church-Turing Thesis
Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.
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.
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 E…
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 discussio…
Introduction to Logic and Recursion Theory
Notes from the class taught by Prof. Sacks in the Spring of 1998.
Open Questions in Recursion Theory
Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].
Showing 20–8 of 8 results