4 ms·
> The halting problem applies to all systems able to perform Peano arithmetic. You're confusing the halting problem with Gödel's first incompleteness theorem.
by skew 7d ago
> The halting problem applies to all systems able to perform Peano arithmetic.
You're confusing the halting problem with Gödel's first incompleteness theorem.
And Bend is just claiming to be sound but incomplete
- lutusp 6d ago> You're confusing the halting problem with Gödel's first incompleteness theorem. So did Alan Turing, but ... he wasn't confused. The two are connected. > And Bend is just claiming to be sound but incomplete That is not what was said. Here it is: "Bend – a language that blocks AI mistakes via proof." That's not possible, and changing what was claimed is not productive.