recursively enumerable setA potentially infinite set whose members can be enumerated by a universal computer; however, a universal computer may not be able to determine that something is not a member of a recursively enumerable set. The halting set is recursively enumerable but not recursive. Related category SETS AND SET THEORYAlso on this site: Encyclopedia of Alternative Energy & Sustainable Living Encyclopedia of History |