Difference between revisions of "Paper/mov is Turing-complete"
Jump to navigation
Jump to search
| Line 6: | Line 6: | ||
|date=July 19, 2013 | |date=July 19, 2013 | ||
|publisher=Computer Laboratory, University of Cambridge | |publisher=Computer Laboratory, University of Cambridge | ||
|location=[[Paper/mov is Turing-complete|local page]] | |||
}} | }} | ||
å | å | ||
Revision as of 16:22, 12 May 2022
Dolan, Stephen (July 19, 2013). "mov is Turing-complete" (PDF). local page: Computer Laboratory, University of Cambridge. å
Dolan's idea have been implemented with software. Christopher Domas[1] and Timo Denk[2] has done so.
References
- ↑ Domas, Christopher (Aug 8, 2017). reductio ad absurdum by Christopher Domas. local page: Shakacon LLC Youtube Channel.
- ↑ Denk, Timo (December 17, 2017). "MOV is Turing-Complete: 4-bit Adder Implementation". local page: Timo Denk's blog.