Re: Turing Machine computable functions apply finite string transformations to inputs

On 30/04/2025 16:09, olcott wrote:
<snip>

Turing machine computable functions must apply
finite string transformation rues to inputs
to derive outputs.
 This is not a function that computes the sum(3,2):
int sum(int x, int y) { return 5; }

Here's an animated example of a TM adding two numbers (2 and 3, by a happy chance).
<https://t4tutorials.com/turing-machine-to-add-two-binary-numbers/>
Using building blocks like these, it is in principle possible to build an operating system. It is not, however, possible to compute an incomputable function.
--
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within