3 ms·
> It's the "Universal Turing Machine" for LLMs. A closer analogy is the Hutter Search (http://hutter1.net/ai/pfastprg.pdf http://hutter1.net/ai/pfastprg.pdf),
by progval 2y ago
> It's the "Universal Turing Machine" for LLMs.
A closer analogy is the Hutter Search (http://hutter1.net/ai/pfastprg.pdf http://hutter1.net/ai/pfastprg.pdf), as it is also an algorithm that can solve any problem. And it is probably too inefficient to use in practice, like the Hutter Search.