Effectively Denumerable

Definition

A set $A$ is denumerable iff there is a bijection $\varphi :\mathbb{N}\cong A$.
A set is effectively denumarable iff it is denumerable and ${\varphi }^{-1}$ and $\varphi$ are computable.

Alternative definition is given on StackExchange.

References

cutland1980-computability