A Foundation for Computable Analysis

摘要

While for countable sets there is a single computability theory (ordinary recursion theory), for computability in Analysis several mutually non-equivalent theories have been proposed, none of which, however, has been accepted by the majority of mathematicians or computer scientists.