Internet Encyclopedia of Science
SETS AND SET THEORY
A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

                   HOME
ABOUT
CATEGORIES
COPYRIGHT
NEWSLETTER

  



recursively enumerable set



A 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 THEORY


Also on this site:

Encyclopedia of Alternative Energy & Sustainable Living
Encyclopedia of History





BACK TO TOP