4 ms·
That's really not what it says. Godel's incompleteness theorem applied to AI would say something like 'There are statements about the model's behavior we cannot
by anon291 2y ago
That's really not what it says. Godel's incompleteness theorem applied to AI would say something like 'There are statements about the model's behavior we cannot prove without relying on statements that cannot to be proven' (this is because obviously the AI algorithms are based on elementary arithmetic).
- strogonoff 2y agoThe theorem applies beyond elementary arithmetic to any formal system. If we try to be rigorous in that way with our models of the universe, the theorem would say that no matter how formally sound our models are they will have to be incomplete, incorrect, or non-provable; that is, we would not be able to rule out the existence of consciousness or figurative pink elephants. (And if they are not formally sound in that way, our models can be safely considered to be incorrect/incomplete simply because they are not formally sound in that way.)