There is a weaker property too, called semidecidable. A set is called semidecidable (or recursively enumerable), if the algorithm described above can only decide if an element is in the set or is not in the set in finite time, but not both. 