In computability theory and computational complexity theory, RE (recursively enumerable) is the class of decision problems for which a 'yes' answer can...