Sujet : Re: My reviewers think that halt deciders must report on the behavior of their caller
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 12. Jul 2025, 09:00:43
Autres entêtes
Organisation : -
Message-ID : <104t4na$21rg3$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
User-Agent : Unison/2.2
On 2025-07-11 15:25:29 +0000, olcott said:
On 7/11/2025 3:40 AM, Mikko wrote:
On 2025-07-10 14:35:11 +0000, olcott said:
On 7/10/2025 5:54 AM, Fred. Zwarts wrote:
Op 09.jul.2025 om 15:02 schreef olcott:>
All Turing machine deciders only compute the mapping
from their actual inputs. This entails that they never
compute any mapping from non-inputs.
At least one thing you understand.
*From the bottom of page 319 has been adapted to this*
https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf
*The Linz proof does not understand this*
Proofs don't understand. They prove.
It fails to prove undecidability when the decider
correctly excludes directly executed Turing machines
from its domain.
That does not change the last sentence of the proof. Therefore the
proof proves what it would prove anyway.
-- Mikko
…