All of computation and human reasoning can be encoded as finite string transformations

No counter-example to the above statement exists for all
computation and all human reasoning that can be expressed
in language.
Double-talk, weasel words and ad hominem attacks count as
pure foolishness and zero rebuttal what-so-ever.
Finding an example of a computation that cannot be
expressed as finite string transformation rules is
the only possible valid rebuttal to the above.
int DD()
{
   int Halt_Status = HHH(DD);
   if (Halt_Status)
     HERE: goto HERE;
   return Halt_Status;
}
DD simulated by HHH according to the semantics of the C
language (the correct finite string transformation rules)
cannot possibly reach its own "return" instruction final
halt state.
Imagining what the simulated DD should do stupidly ignores
what this DD actually does. This may be dishonest instead
of stupid.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer