There exist recursively enumerable sets which are not recursive. The phrase recursively enumerable (often abbreviated "r.e.") is the mathemat ical counterpart to our artistic notion of "cursively drawable"—and recursive is the counterpart of "recursive".