Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: Sufficient knowledge of C proves that DD specifies
 non-terminating behavior to HHH
Date: Tue, 18 Feb 2025 18:38:34 -0500
Organization: i2pn2 (i2pn.org)
Message-ID: <b4b45a56e0c2dd49df69f91f078d1042c13e9206@i2pn2.org>
References: <vnumf8$24cq0$1@dont-email.me> <voft9v$1rkco$1@dont-email.me>
 <e351c3a68fe9fffc21c6b82a50743305af794dd0@i2pn2.org>
 <vojrqp$2oikq$3@dont-email.me>
 <ffb46665a51356faf0fa3b56db966a31812e8134@i2pn2.org>
 <vokon8$2t882$1@dont-email.me> <vol0mf$2ulu5$1@dont-email.me>
 <vom1q4$34osr$3@dont-email.me> <von3q8$3d901$1@dont-email.me>
 <vone2v$3ffar$3@dont-email.me> <vonibr$3g195$1@dont-email.me>
 <voobvq$3kga9$1@dont-email.me> <vophu2$3ufag$1@dont-email.me>
 <voqpf6$5k6g$1@dont-email.me> <vosc1j$h568$2@dont-email.me>
 <vosnea$jd5m$2@dont-email.me> <voth2j$o3pk$1@dont-email.me>
 <votn62$pb7c$2@dont-email.me> <voutp5$12hqt$1@dont-email.me>
 <vovfov$15ohc$1@dont-email.me> <vovlfh$160g5$1@dont-email.me>
 <vovqjp$17scr$1@dont-email.me> <vp05ff$19vgo$1@dont-email.me>
 <vp05v8$19oed$1@dont-email.me>
 <b2da5d2b71ff0b6f4b7f3c1cec00d31c6681d37e@i2pn2.org>
 <vp1im8$1kden$1@dont-email.me> <vp1qh7$1m05h$1@dont-email.me>
 <46154e2ca31e87a86a047949f806f2b73c6745cc@i2pn2.org>
 <vp220j$1n991$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 18 Feb 2025 23:38:35 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="697608"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
In-Reply-To: <vp220j$1n991$2@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 2543
Lines: 16

On 2/18/25 8:29 AM, olcott wrote:
> On 2/18/2025 6:25 AM, Richard Damon wrote:
>> On 2/18/25 6:22 AM, olcott wrote:
>>>
>>> I am talking about the impossibility of defining an Algorithm to 
>>> correctly encode square circles not placing any limit on computation.
>>>
>>
>> And who cares about that.
>>
> 
> It is generally the case that problems that are defined to be impossible
> DO NOT EVER ACTUALLY LIMIT COMPUTATION.
> 

Sure they do, they show some things that could never have been computed, 
which is knowledge that wasn't know before the impossibility was known.