Describe the concept of recursively enumerable (RE)

A set is recursively enumerable (RE) if there is a Turing machine that will list all the elements of the set, possibly with repetitions, and halt for each element. If an element belongs to the set, the machine will eventually produce it; if it doesn't, the machine may run indefinitely. RE sets encompass problems for which a solution can be verified by a Turing machine.