Computation by Discrete Neural Nets: Stan Franklin and Max Garzon
Classical computability theory is a branch of theoretical computer science. It concerns itself with determining which algorithmic problems can be solved by computers (or models thereof, e.g., Turing machines) given even the most unrealistically ideal availability of time and memory. The theory probes the outer limits of what can ever be computed with man-made devices. It is a mathematical theory in that formal definitions are given and theorems are then proven concerning computational power.