this post was submitted on 08 Oct 2023
38 points (89.6% liked)
AI
4142 readers
1 users here now
Artificial intelligence (AI) is intelligence demonstrated by machines, unlike the natural intelligence displayed by humans and animals, which involves consciousness and emotionality. The distinction between the former and the latter categories is often revealed by the acronym chosen.
founded 3 years ago
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Also being able to analyze any program and guarantee it will stop
Probably still a never say never problem:
If you actually read the article, it doesn't say anything about being able to solve the halting problem. It used the undecidability of the halting problem to prove equivalence of another class of problems to the halting problem.
Which is why I said it was still a "never say never" and not an already solved problem.
The halting problem is impossible for Turing machines, but if hypercomputation ends up possible, it isn't impossible.
For example, an oracle machine as proposed by Turing, or a 'real' computer using actual real values.
The latter in particular may even end up a thing in the not too distant future assuming neural networks continue to move into photonics in such a way that networks run while internals are never directly measured. In that case the issue would be verifying the result - the very topic of the paper in question.
Effectively, while it is proven that we can never be able to directly measure a solution to the halting problem, I wouldn't take a bet that within my lifetime we won't have ended up being able to indirectly measure a solution to the problem and directly validate the result.