Regarding, re.
Abbreviation 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.