Worth Reading: AGI, the Halting Problem and the Human Mind Ewert’s central claim is based on Turing’s halting problem in computer science, which demonstrates that no algorithm can universally determine whether another algorithm will halt or run forever. He extends this principle to argue that an algorithm can only create an algorithm less sophisticated than itself. Related ← Worth Reading: Off-Path Attacks on the TCP/IP Protocol SuiteWorth Reading: Measuring DNS root servers under change →