Enumeration problem
From Encyclopedia of Mathematics
An algorithmic problem in which one has to construct an algorithm that enumerates 
for a given set 
, i.e. an algorithm 
that is applicable to any natural number, that converts it to an element of 
and such that any element of 
is obtained by applying 
to some natural number; in other words, 
. The enumeration problem for a set 
is solvable (i.e. such an 
exists) if and only if 
is a non-empty enumerable set.
How to Cite This Entry:
Enumeration problem. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Enumeration_problem&oldid=46832
Enumeration problem. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Enumeration_problem&oldid=46832
This article was adapted from an original article by V.E. Plisko (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article