Computable Total Function

computation

Definition

Computable Total Function

A total function $f:X\to Y$ is called computable if there exists an algorithm $A$ that takes any $x\in X$ as input, halts, and outputs a correct $f(x)$.

Trivially, this is a stricter form of computability than partial functions.