Re – Wikipedia, the free encyclopedia RE (complexity), the set of recursively enumerable languages Re – Wikipedia, the free encyclopedia.