Many should have been annoyed by the low-level-ness of the traditional Turing Machine. Spu comes to the rescue.
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.
https://sourceforge.net/projects/cscall/
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.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 546 |
Nodes: | 16 (2 / 14) |
Uptime: | 12:59:04 |
Calls: | 10,389 |
Calls today: | 4 |
Files: | 14,061 |
Messages: | 6,416,887 |
Posted today: | 1 |