Computable Function

Natural & Formal Sciences Dictionary
Definition
A mapping from finitely encoded inputs (commonly finite strings or natural numbers) to outputs for which there exists a finite, mechanically executable procedure that, on every valid input, halts and produces the correct output.