Any traditional computer such as a Turing machine or a Post machine or any other reasonable computer can become a self-referential Gödel machine by just loading it with a particular form of machine-dependent software, software that is self-referential and has the potential to modify itself.
But Gödel machines cannot in any way overcome the fundamental limitations of computability and of theorem proving which were first identified in 1931 by Kurt Gödel himself.