Sujet : Re: A New Turing Machine Model
De : ben (at) *nospam* bsb.me.uk (Ben Bacarisse)
Groupes : comp.theoryDate : 13. Feb 2025, 00:28:10
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <878qqaoi9h.fsf@bsb.me.uk>
References : 1
User-Agent : Gnus/5.13 (Gnus v5.13)
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.
Spu is a simple C++ class, the significance is that it can also be used as a
theoretical TM model, greatly simplifies deduction and statement based on TM
and also significantly provides a way of mechanical verification.
Do you have an example deduction you can present?
https://sourceforge.net/projects/cscall/
Where is Spu? That project appears to have nothing by that name.
-- Ben.