Differences between revisions 1 and 2
⇤ ← Revision 1 as of 2003-11-02 22:00:51 →
Size: 276
Editor: yakko
Comment:
← Revision 2 as of 2006-07-02 21:50:13 → ⇥
Size: 357
Editor: dot
Comment:
Deletions are marked like this. Additions are marked like this.
Line 5: Line 5:
This is the same as RecursivelyEnumerable when talking about language theory.

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

SemiDecidable (last edited 2006-07-02 21:50:13 by dot)