[lp4vn]

What I find it funny about this LLM euphoria is that people seem to have forgotten the theoretical limits of what turing machines can do.

Program equivalence, for instance, hits the wall of the halting problem. Yet somehow people think that it's just a matter of time before an AI that can solve the problem of giving you a mathematically equivalent code to an existing code.

[staunton]

There's two reasons why "halting problem" does not mean that's impossible in practice. First, the halting problem deals with arbitrary length programs that have infinite memory. Second, we don't need to solve "all cases" of the problem. You could have a system that times out for some inputs but is still very useful.

[adamnemecek]

> Program equivalence, for instance, hits the wall of the halting problem. Yet somehow people think that it's just a matter of time before an AI that can solve the problem of giving you a mathematically equivalent code to an existing code.

This is a solved problem in the context of total programming.