Even Accelerating Machines are Not Universal
Selim G. Akl
We draw an analogy between Godel’s Incompleteness Theorem in mathematics, and the impossibility of achieving a Universal Computer in computer science. Specifically, Godel proved that there exist formal systems of mathematics that are consistent but not complete. In the same way, we show that there does not exist a general-purpose computer that is universal in the sense of being able to simulate any computation executable on another computer.