On 10/29/2025 5:07 AM, Mikko wrote:Note that the above still keeps the option to deceive with equivocation.>
Not at all, it is stipulated that H does simulate
D according to the semantics of the C language until
H sees that itself is stuck in recursive simulation.
Then H reports 0, whereas if the simulation is continued,
it hals in th esmae way as a D() executed on a regular
simulartor/processor.
The halting problem is somehow vanquished because we /call/ the zero
return correct, due to it being a wrong question to ask H about the
halting of D().
Yet, nothing has changed; we don't have an algorithm that can whether
every P() halts, which we already know from the standard halting
problem.
The halting problem has supposedly gone way because the question
that it asks is not allowed.
We can likewise banish rational numbers, and make this an incorrect
question:
4x = 3; what is x?
--
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
Mastodon: @Kazinator@mstdn.ca
Les messages affichés proviennent d'usenet.