Re: A New Turing Machine Model

Liste des GroupesRevenir à theory 
Sujet : Re: A New Turing Machine Model
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory
Date : 13. Feb 2025, 05:24:33
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vojs62$2oikq$5@dont-email.me>
References : 1 2
User-Agent : Mozilla Thunderbird
On 2/12/2025 5:28 PM, Ben Bacarisse wrote:
wij <wyniijj5@gmail.com> writes:
 
Many should have been annoyed by the low-level-ness of the traditional Turing
Machine. Spu comes to the rescue.
 The low-level is useful because it simplifies a lot of proofs, but when
something higher-level is needed Turing equivalence and other results
like the Curry-Howard correspondence mean that there is no shortage of
higher-level models to work with.
 
https://en.wikipedia.org/wiki/Random-access_stored-program_machine
Concise, precise and easily mapped to many higher level language.
I have simply assumed that C maps to RASP and then used C.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

Date Sujet#  Auteur
12 Feb 25 * A New Turing Machine Model4wij
13 Feb 25 `* Re: A New Turing Machine Model3Ben Bacarisse
13 Feb 25  `* Re: A New Turing Machine Model2olcott
13 Feb 25   `- Re: A New Turing Machine Model1Richard Damon

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal