Liste des Groupes | Revenir à theory |
Op 27.aug.2024 om 14:44 schreef olcott:When 100% of the whole point is for HHH to correctly determineOn 8/27/2024 3:38 AM, Fred. Zwarts wrote:Apparently you do not even understand the English that is used to describe the straw man fallacy.Op 27.aug.2024 om 04:33 schreef olcott:>This is intended to be a stand-alone post that does not>
reference anything else mentioned in any other posts.
>
void DDD()
{
HHH(DDD);
return;
}
>
_DDD()
[00002172] 55 push ebp ; housekeeping
[00002173] 8bec mov ebp,esp ; housekeeping
[00002175] 6872210000 push 00002172 ; push DDD
[0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
[0000217f] 83c404 add esp,+04
[00002182] 5d pop ebp
[00002183] c3 ret
Size in bytes:(0018) [00002183]
>
When we assume that:
(a) HHH is an x86 emulator that is in the same memory space as DDD.
(b) HHH emulates DDD according to the semantics of the x86 language.
>
then we can see that DDD emulated by HHH cannot possibly get past
its own machine address 0000217a.
>
>
Yes, we see. In fact DDD is not needed at all.
A straw man fallacy (sometimes written as strawman) is the informal fallacy of refuting an argument different from the one actually under discussion...
https://en.wikipedia.org/wiki/Straw_man
Or are trying to distract the attention from the fact that DDD is not needed is a simple truism, a tautology in your terms?
-->In the following program>
>
int main() {
return HHH(main);
}
>
HHH cannot possibly simulate itself up to the end of itself. Still HHH halts, which proves that there is an end. The only conclusion is, that the simulation is incomplete and therefore incorrect.
Further it is incorrect to think that the fact that the simulation halts too soon is an indication for non-halting behaviour. The analysis of that 'special condition' is the real problem, not the partial incorrect simulation.
>
Les messages affichés proviennent d'usenet.