Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD)

Am Mon, 12 May 2025 11:32:20 -0500 schrieb olcott:

On 5/12/2025 6:46 AM, dbush wrote:

On 5/12/2025 12:11 AM, olcott wrote:

I am examining all the elements of a infinite set such that each
HHH/DDD pair has a specific fixed form.

 
And each one has a distinctly different input, and as such the halt
status of one is unrelated to the halt status of another.
 
Changing the input is not allowed.

 
In other words you are clueless about mathematical induction.
It is true that when one step of DDD is emulated by HHH that DDD does
not halt.
It is true that when N steps of DDD are emulated by HHH that DDD does
not halt.

How many steps are simulated doesn't change whether the direct execution
halts or not. HHH takes infinitely many steps to simulate DDD halting.

--
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.