 A related definition is that of a computably enumerable (or c.e.) set—i.e., one whose members can be enumerated by an effective procedure. (In the older terminology of  Section 2  such a set is said to be recursively enumerable which is traditionally abbreviated r.e.) Officially we have the following: