2 ms·
> It's impossible for finite number of LLMs to solve all theorems. This would imply that the busy beaver sequence is computable which implies the halting proble
by BoredomIsFun 2mo ago
> It's impossible for finite number of LLMs to solve all theorems. This would imply that the busy beaver sequence is computable which implies the halting problem is decidable
LLMs use RNG for sampling, so they are not pure computers.
- fsmv 2mo agoComputable includes BPP
- BoredomIsFun 2mo agoNot sure if GPT based LLMs are polynomial time.