sejo
/
compudanzas
2
3
Fork 3
Code Issues Pull Requests Projects Releases Wiki Activity

added cook link, and notes on turing completeness

This commit is contained in:
sejo 2021-09-08 18:51:22 -05:00
parent f639c727a7
commit 1dc6d94fc2
2 changed files with 12 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
src/qiudanz_technique.gmo
View File

@ -89,4 +89,12 @@ a way of complexifying any of these would be to learn to apply more than one tra
another possibility would be to have beforehand a list of transformation to apply, with some or all of them being conditional on the movement currently in the head.
this would allow for turing-completeness :)
## turing completeness
having some way of assigning the transformations to apply given the current movement in the head, would allow to perform arbitrary tag systems and/or turing machines, and m>1 tag systems are turing complete, e.g.:
=> https://dspace.mit.edu/bitstream/1721.1/6107/2/AIM-052.pdf Universality of Tag Systems with P = 2 (1964) Cocke and Minsky
however, cyclic tag systems are also turing complete, and they only require the sequential application of rules:
=> https://wpmedia.wolfram.com/uploads/sites/13/2018/02/15-1-1.pdf Cook, Matthew (2004). "Universality in Elementary Cellular Automata" (PDF). Complex Systems. 15: 1–40.

4
src/references.gmo
View File

@ -41,7 +41,9 @@ texts by solderpunk in the {gemini} protocol
=> https://archive.org/details/computationfinit0000mins/ Computation: finite and infinite machines (1967) Minsky
=> https://www.semanticscholar.org/paper/Universality-of-Tag-Systems-with-P-%3D-2-Cocke-Minsky/ada3045434a410b4e84d2944590ff54fe5daa4ef Universality of Tag Systems with P = 2 (1964) Cocke and Minsky
=> https://dspace.mit.edu/bitstream/1721.1/6107/2/AIM-052.pdf Universality of Tag Systems with P = 2 (1964) Cocke and Minsky
=> https://wpmedia.wolfram.com/uploads/sites/13/2018/02/15-1-1.pdf Cook, Matthew (2004). "Universality in Elementary Cellular Automata" (PDF). Complex Systems. 15: 1–40.
# non-electronic computers