COMPUTABILITY
AND
COMPLEXITY
Algorithmic information theory.
Computability and non-computability in pure mathematics (in particular,
functional analysis and operator theory), theoretical physics
(specifically, quantum mechanics), theoretical economics, and other
areas; complexity of computation in those fields.
Open questions in randomness and computability
Back to main page
Information about this site |
Last modified on February 2007