chapter
8 Pages

E

For example, the set of all natural numbers n such that there exists a consecutive run of exactly n 5s in the decimal expansion of π is effectively enumerable.

This notion is intuitive; the corresponding formal notion is recursively enumerable, also known as computably enumerable. See recursively enumerable.