Liste des Groupes | Revenir à theory |
On 6/9/2024 9:16 AM, Andy Walker wrote:Which you have proven you don't have.If anyone says something new, perhaps they could indicate this in the "Subject" line, as a service to humanity.*You must know the C programming language to understand this*
>
typedef void (*ptr)(); // pointer to void functionBut it isn't, so you are shown to not know what that would be.
void HHH(ptr P, ptr I)
{
P(I);
return;
}
void DDD(int (*x)())
{
HHH(x, x);
return;
}
int main()
{
HHH(DDD,DDD);
}
In the above Neither DDD nor HHH ever reach their own return
statement thus never halt.
When HHH is a simulating halt decider then HHH sees that
DDD correctly simulated by HHH cannot possibly reach its
own return statement, AKA
simulating halt decider HHH correctly simulates its input DDDAnd since it never can do that with this
until HHH correctly determines that its simulated DDD would never
stop running unless aborted
*as defined here*Right, since a "Correct Simulation" here means a simulation that exactly recreates the behavior of the machine descirbed by the input, and that means that such a simulation can not stop before it reaches a final state, your argurement doesn't work.
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
If simulating halt decider H correctly simulates its input D
until H correctly determines that its simulated D would never
stop running unless aborted then
H can abort its simulation of D and correctly report that D
specifies a non-halting sequence of configurations.
</MIT Professor Sipser agreed to ONLY these verbatim words10/13/2022>
Les messages affichés proviennent d'usenet.