Sujet : Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion ZFC
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 24. May 2025, 02:41:06
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <ab8259b6b29b014efa78beac56a14162e7177376@i2pn2.org>
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
User-Agent : Mozilla Thunderbird
On 5/23/25 5:06 PM, olcott wrote:
On 5/23/2025 3:50 PM, Richard Heathfield wrote:
On 23/05/2025 21:24, olcott wrote:
>
<snip>
>
Liar
>
An unequivocal response, but it lacks persuasive power.
>
When I provide the exact detailed steps of exactly how
people can show that I am wrong and they refuse to
show that I am wrong yet claim that I am wrong this
is the kind of reckless disregard for the truth that
loses defamation cases.
But people don't need to use your FAULTY criteria.
The fact that you have ADMITTED that your whole argument is a category error means no more proof is needed.
Since the Halting Problem is about making a DECIDER, that is a type of PROGRAM, that decides on PROGRAMS (given via a representation), and you have positively admitted that your HHH, and the input DD / DDD are absolutely NOT programs, your whole argument FAILS by not meeting the entry requirements.
Sorry, but you stipulated yourself out of the problem.