Science

An online course on complexity.

This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.

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.

Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.

Wikipedia article.

Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].

The CCA Network provides some useful information for researchers working in the field of computability and complexity in analysis.