Re: AI for optimization?

On 2025-05-25, antispam@fricas.org <antispam@fricas.org> wrote:
> Of course we will see companies applying LLMs techniques with
> little checks, but this is due to how companies works, if not
> LLMs than something else would be abused.


LLM-generated code cannot just be checked, because checking equivalence
of two pieces of code is as hard as the Halting Problem.


At best you can do it for very short program fragments, (like basic
blocks of instructions, or small trees) that can be executed to see if
they have the right effect on all the temporary registers. (How genetic
programming works, more or less.) If the fragments don't contain any
looping or recursion, you don't have to worry about nontermination.


--
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
Mastodon: @Kazinator@mstdn.ca
[General program equivalence is the halting problem, but there are subsets where
you can say these two programs are equivalent or those two are not. The question
is whether there are enough of those to be useful. I have no idea. -John]

Return to the comp.compilers page.
Search the comp.compilers archives again.