On Cardinalities of $\mathcal{RE}$ and $\mathcal{P}(\mathbb{N})$

74 Views Asked by At

We denote $\mathcal{RE}$ as the universe set of recursively enumerable sets. A set is recursively enumerable iff its semi-charactersitic function is computable (one can write its semi-verifier). The question is, can we build a bijection between $\mathcal{RE}$ and the powerset of naturals?