6 ms·
I agree. I'm waiting for someone to invent a programming language designed for LLMs where for a given partial program p and candidate token t it's possible to t
by WithinReason 25d ago
I agree. I'm waiting for someone to invent a programming language designed for LLMs where for a given partial program p and candidate token t it's possible to tell whether p+t can be the prefix of a correct program or not so that t can be excluded from the LLM's probability distribution at generation time, so the LLM can only generate correct programs. Or something like that.
- cpill 25d agodoesn't this imply it would solve the halting problem?
- WithinReason 25d agoNo, practical programs don't need full Turing completeness. Most programs you want to write you intend to either halt or run indefinitely, because you want to avoid crashes.
- deleted 25d ago[deleted]