I insist on some facts (I quote the article to which you refer)
A Gödel numbering is not unique, in that for any proof using Gödel numbers, there are many ways in which these numbers could be defined.
I don't know if you understand this but it means that there can't exist THE Godelizer.
In computability theory, the term "Gödel numbering" is used in settings more general than the one described above. It can refer to:
1. Any assignment of the elements of a formal language to natural numbers in such a way that the numbers can be manipulated by an algorithm to simulate manipulation of elements of the formal language.
2. More generally, an assignment of elements from a countable mathematical object, such as a countable group, to natural numbers to allow algorithmic manipulation of the mathematical object.
Also, the term Gödel numbering is sometimes used when the assigned "numbers" are actually strings, which is necessary when considering models of computation such as Turing machines that manipulate strings rather than numbers.
As mentioned, it is "computability THEORY". I don't know of any program that ACTUALLY do this and I'm pretty sure that there's a theorem that says such a program CAN'T EXIST.