| ▲ | shhsshs a day ago | |||||||||||||||||||||||||
A compiler translating high-level code to machine code is a predictable and repeatable process. An LLM translating a prompt to to high-level code has a much lower degree of predictability. To say an LLM prompt is a comparable abstraction is unfair, though I admit it's getting very close. | ||||||||||||||||||||||||||
| ▲ | bluegatty a day ago | parent [-] | |||||||||||||||||||||||||
The LLM will never produce the same output each time, it doesn't have to do that to have very strong level of abstraction. But yes, it has to fulfill some kind of contract defined by the absraction. It's less a problem of the LLM, and more so how we use them, and the inherent tooling around it. | ||||||||||||||||||||||||||
| ||||||||||||||||||||||||||