Computability theory investigates the fundamental limits and capabilities of algorithmic processes, asking which problems can be solved by a mechanical procedure and how efficiently. Algebraic ...

Computability theory establishes which problems can in principle be solved by mechanical procedures, formalised by the Turing machine model and its equivalents. It draws a firm boundary between ...

We show that to every recursive total continuous functional Φ there is a PCF-definable representative Ψ of Φ in the hierarchy of partial continuous functionals, where PCF is Plotkin's programming ...