Sujet : Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion ZFC
De : dbush.mobile (at) *nospam* gmail.com (dbush)
Groupes : comp.theoryDate : 28. May 2025, 21:13:18
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <1017qot$3drlu$2@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
User-Agent : Mozilla Thunderbird
On 5/28/2025 11:17 AM, olcott wrote:
When you require sum(3,4) to report on the sum of 5 + 6
YOU ARE WRONG. When you require HHH to report on the
behavior of its caller YOU ARE WRONG.
But I want to know what it's caller does.
In fact, I want to know if any arbitrary algorithm X with input Y will halt when executed directly.
It would be *very* useful to me if I had an algorithm H that could tell me that in *all* possible cases. If so, I could solve the Goldbach conjecture, among many other unsolved problems.
Does an algorithm H exist that can tell me that or not?