Definition:Recursively Enumerable Set

Definition
Let $k \in \N$ be a natural number.

Let $f : \N^k \to \N$ be a recursive function.

Let $S = \Img f$ be the image of $f$.

Then $S$ is a recursively enumerable set.