Liste des Groupes | Revenir à c theory |
On 6/2/2024 1:16 PM, Fred. Zwarts wrote:PLEASE, PLEASE keep your promises.Op 02.jun.2024 om 16:58 schreef olcott:*I am not going to keep repeating myself, I will simply give up on you*On 6/2/2024 4:36 AM, joes wrote:>Am Sat, 01 Jun 2024 17:37:28 -0500 schrieb olcott:>
>On 6/1/2024 5:30 PM, Richard Damon wrote:>On 6/1/24 5:27 PM, olcott wrote:On 6/1/2024 4:15 PM, Richard Damon wrote:On 6/1/24 4:35 PM, olcott wrote:On 6/1/2024 3:29 PM, Richard Damon wrote:On 6/1/24 12:46 PM, olcott wrote:On 6/1/2024 11:33 AM, Richard Damon wrote:On 6/1/24 12:18 PM, olcott wrote:On 6/1/2024 11:08 AM, Richard Damon wrote:On 6/1/24 11:58 AM, olcott wrote:On 6/1/2024 10:46 AM, Richard Damon wrote:On 6/1/24 10:00 AM, olcott wrote:Not simulating an infinite number of steps of infinite recursion is>Every DD correctly simulated by any HH of the infinite set of HH/DD>
pairs that match the above template never reaches past its own
simulated line 03 in 1 to ∞ steps of correct simulation of DD by HH.
But since the simulation was aborted,
*The above never mentions anything about any simulation being aborted*
incorrect. You always forget this requirement: the simulation must be
complete.
When every possible simulation where DD is correctly simulated by HH
never reaches past its own simulated line 03 then we know for sure that
No DD correctly simulated by HH ever halts.
Similarly:
>
When every possible simulation where HH is correctly simulated by itself
never reaches its own return then we know for sure that no HH correctly simulated by HH ever halts.
>
HH(DD,DD) correctly detects that DD correctly simulated by HH cannot
possibly halt because HH keeps calling HH(DD,DD) in recursive
simulation.
After two instances of DD calling HH(DD,DD) in recursive simulation HH
has detected the repeating state by DD and aborts its simulation of DD
right before it calls HH(DD,DD) again.
Les messages affichés proviennent d'usenet.