Liste des Groupes | Revenir à theory |
On 6/11/2025 9:42 AM, joes wrote:The surce of the incorrectness is obvious: joes assumed that whatAm Wed, 11 Jun 2025 09:11:32 -0500 schrieb olcott:The fact that HHH reaches its own "return" statementOn 6/11/2025 3:29 AM, Mikko wrote:On 2025-06-10 16:10:49 +0000, olcott said:On 6/10/2025 7:01 AM, Mikko wrote:On 2025-06-09 14:46:30 +0000, olcott said:On 6/9/2025 6:24 AM, Richard Damon wrote:On 6/8/25 10:50 PM, olcott wrote:That is what HHH does.The *input* to simulating termination analyzer HHH(DDD)So, you think a partial simulation defines behavior?
specifies recursive simulation that can never reach its *simulated
"return" instruction final halt state*
Where do you get that LIE from?
It is also proof that HHH doesn't terminate.DDD correctly simulated by HHH cannot possibly reach its own "return"Either the pattern or the recognition is incorrect.It only takes two simulations of DDD by HHH for HHH to correctlyI am no so stupid that I require a complete simulation of aYes you are. You just express your stupidity in another way.
non-terminating input.
recognize a non-halting behavior pattern.
statement final halt state. This by itself *is* complete proof that the
input to HHH(DDD) specifies non-halting behavior.
final halt state proves that you are incorrect.
Les messages affichés proviennent d'usenet.