Back to ComputerTerms
A set M of n-tuples is SemiDecidable if there exists an algorithm that halts and reports "YES" for every n-tuple of natural numbers in M, and halts and reports "NO" or fails to halt if the n-tuple does not belong to M.
This is the same as RecursivelyEnumerable when talking about language theory.
Back to ComputerTerms