Re: HHH(DD) --- COMPUTE ACTUAL MAPPING FROM INPUT TO OUTPUT --- Using Finite String Transformations

On 4/16/25 4:14 PM, olcott wrote:

On 4/16/2025 1:09 PM, Alan Mackenzie wrote:

Mr Flibble <flibble@red-dwarf.jmc.corp> wrote:

On Wed, 16 Apr 2025 13:29:18 +0100, Richard Heathfield wrote:

>

The question is whether a universal termination analyser can be
constructed, and the answer is that it can't.

>

Aren't you kind of putting the cart before the horse with such an
assertion?  Maybe the prior art you are basing that assertion on is wrong?

>
You're speaking from ignorance of mathematics.  The halting problem has
been unequivocally proven.  It is a simple theorem, only slightly more
complicated than 2 + 2 = 4.
>
We're not talking about "prior art", or anything like that.  We're
talking rigorous mathematics.  We're talking about absolute truth,
something that Peter Olcott does not understand.  You don't need to join
him.
>

/Flibble

>

 Moronically stupid "rigorous mathematics" that is far
too stupid to know that unless the finite string input
input is transformed by finite string transformation
operations into outputs that you are doing the computer
science stupidly incorrectly.
 All of logic, reasoning and computation boils down to
finite string transformations on inputs deriving outputs.
 

Spo you admit that you aren't following the rules of the system you care claiming to be working in, and thus admitting that you are just a liar.
You don't seem to understand the essential difference between capabilities and requirements.
Of course, part of the problem with requirements is they are something that must be obeyed and that limits what you are allowed to do, wnich you just don't understand about.