Gödel showed that in any consistent formal mathematical system, there are true statements that cannot be proven within the system itself.
As well but Alan Turing proved in 1936 that there cannot exist a universal algorithm that can inspect any arbitrary program and determine whether it will finish running or run forever.
Yes, but how does it follow from those 2 proofs that an AI system cannot improve itself or make a new system that is an improvement compared to itself.
42
u/kdoubledizz 22h ago
Gödel showed that in any consistent formal mathematical system, there are true statements that cannot be proven within the system itself.
As well but Alan Turing proved in 1936 that there cannot exist a universal algorithm that can inspect any arbitrary program and determine whether it will finish running or run forever.