No title
One of the first results in classical computability theory was establishing the undecidability of the halting problem. In this thesis we will prove an even stronger version in the internal logic of the effective topos; more precisely in its full subcategory \(Mod(\mathcal{K}_1)\) of modest sets internal to assemblies \(Ass(\mathcal{K}_1)\). We will do this by proving that the diagonal halting set
