[Jerrrry]

  > the open-domain Frame Problem is equivalent to the Halting Problem and is therefore undecidable.

Thank you, Code as Data problems are innate to the von Nuemman architecture, but I could never articulate how LLMs are so huge they are essentially Turing-complete and equivalent computationally.

You _can_ combinate through them, just not in our universe.

[adgjlsfhk1]

this is very wrong. LLMs are very much not Turing complete, but they are algorithms on a computer so they definitely can't compute anything uncomputable

[Jerrrry]

"Essentially"

This is the #1 pedantic thing HN frequenters flail over.

Turing built a limited machine, bound to a finite tape.

Bravo.