This article constructs a Turing Machine which can solve for β ′ which is REcomplete. Such a machine is only possible if there is something wrong with the foundations of computer science and mathematics. We therefore check our work by looking very closely at Cantor’s diagonalization and construct a novel formal language as an Abelian group which allows us, through equivalence relations, to prov...