(abbreviation, alt-of, countable, initialism, qualifier:computational complexity theory, uncountable) Initialism of recursively enumerable; the class of decision problems for which a “yes” answer can be verified by a Turing machine in a finite amount of time. See more at RE (complexity) on Wikipedia.Wikipedia
I am new to this group and have not had the courage to post many messages. I just had my second/follow-up apointment with my RE today. I have only recently been diagnosed with PCO and had the routine tests, HSG, etc.. done. Today, we talked about those results and what our next plan of action is. 1997 April 21, Sheri Feldbusch, “Looking for a little guidance.”, in alt.support.pco (Usenet):