Back to ComputerTerms

A set M of n-tuples is decidable if there exists an algorithm that halts on every n-tuple of natural numbers and reports "YES" or "NO" depending on whether the n-tuple belongs to the set or not.

Back to ComputerTerms