Liste des Groupes | Revenir à c theory |
On 4/23/2025 7:31 PM, Mike Terry wrote:But is once HHH stops. It is a fact that HHH stops before getting to the end of the correct simulation, and sees nothing besides what is on the correct simulation till it stops, so has nothing to correctly claim that the results will be different than the actual correct simulation.On 23/04/2025 16:38, olcott wrote:It *is not* up to the point where HHH stops simulating.On 4/23/2025 10:28 AM, Mike Terry wrote:>On 23/04/2025 10:02, Fred. Zwarts wrote:>Op 22.apr.2025 om 21:50 schreef olcott:>On 4/22/2025 2:30 PM, Fred. Zwarts wrote:You never showed a proof. You only repeated a dream. You are dreaming many years without any logic. You failed to show the first state change where the direct execution is different from the simulation. You only showed an erroneous HHH that fails to reach the end of the simulation of a halting program.Op 22.apr.2025 om 21:14 schreef olcott:>On 4/22/2025 1:10 PM, Fred. Zwarts wrote:Therefore HHH should report on the actual input, the finite string that describes a halting program. Not on the hypothetical input that does not halt, because it is based on a hypothetical HHH that does not abort.Op 22.apr.2025 om 18:38 schreef olcott:>>And it has been proven that no finite string transformations are possible that report the halting behaviour for all inputs that specify a correct program.
a function is computable if there exists an algorithm
that can do the job of the function, i.e. given an input
of the function domain it can return the corresponding output.
https://en.wikipedia.org/wiki/Computable_function
>
On Turing Machines inputs <are> finite strings, and
finite string transformation rules <are> applied to
these finite strings to derive corresponding outputs.
>
int sum(int x, int y) { return x + y; }
Only when people stupid assume the same thing as
sum(3,2) should return the sum of 5 + 3.
>
>
Why do you maintain that HHH should process the hypothetical input instead of the actual input.
Do you really believe that 3+2 equals 5+3?
I have proven that the directly executed DD and DD
emulated by HHH according to the semantics of the
x86 language have a different set of state changes
many hundreds of times for several years.
Worse than this, on more than one occasion I've actually posted traces of computation DDD(DDD) executed directly and simulated by HHH side by side. Both traces were of course /identical/, up to the point where HHH stops simulating.
*Factually incorrect* (You are usually very careful about these things)
The call to HHH(DD) from the directly executed DD returns.
The call to HHH(DD) from DD emulated by HHH cannot possibly return.
>
...because HHH stops simulating before reaching that step in the computation. Note that I said
>
MT: Both traces were of course /identical/,
*up to the point where HHH stops simulating*
>
So I was factually correct.
>
>
Mike.
>
It is up to the point where the simulated versus directlyAnd then HHH makes an error in its presumption about that call. The programmer of HHH has presumed that calls to HHH(DD) will not return, when it is a fact that calls to HHH(DD) will return 0, since that is the result of what you code for HHH does.
executed calls HHH(DD).
This call immediately from the directly executed DD andNo, by the rules of the x86 language, both will do exactly the same thing, HHH Just in unable to determine what the x86 language specifies foer this call, because its code takes a wrong turn at this point, because its programmer made a wrong assumption here.
cannot possibility return from DD emulated by HHH according
to the finite string transformation rules of the x86 language.
HHH doesn't stop simulating DD until one recursive emulationAnd still stop simulating before it gets to the end which a CORRECT simulator will reach.
later on.
Les messages affichés proviennent d'usenet.