General Halting Problem Problem Problem


Is it possible to prove the halting problem applies to computers that are given constructors that allow them to construct more computers (this likes to break things that were considered proven).

Yes. Even if computers constructing more computers were to result in something more powerful than a TM, it would still be unable to solve its own halting problem. If it is more powerful (which I doubt), it might be able to solve the halting problem for TMs.

See HaltingProblem, GeneralHaltingProblem, GeneralHaltingProblemProblem (seems somebody got into a MentalLoop?)

EditText of this page (last edited November 27, 2014) or FindPage with title or text search