• These jumps are enjoyable (was: recursion is silly)

    From Axel Reichert@21:1/5 to Paul Rubin on Fri Dec 29 10:14:04 2023
    Paul Rubin <no.email@nospam.invalid> writes:

    Julieta Shem <jshem@yaxenu.org> writes:
    Therefore, your computer is actually a finite state machine.

    Usually these theory discussions are about abstract computers without
    such limitations. As one of my professors liked to say in his intro
    lecture about Turing machines, "we can mine the Andromeda galaxy for
    more tape".

    You made my day! (-:

    As a mechanical engineer in the software business I can program on a low hobbyist level in a handful of languages. But combine this with a family background in human languages, and you get someone very much interested
    in abstract concepts (read: powerful) and computer languages, which is
    why I tremendously enjoy the (as of late more lively) discussions that
    jump from code review to lofty theory and back to humour.

    Thanks for that!

    Axel

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)