Difference between revisions of "Paper/mov is Turing-complete"
Jump to navigation
Jump to search
| Line 8: | Line 8: | ||
|location=[[Paper/mov is Turing-complete|local page]] | |location=[[Paper/mov is Turing-complete|local page]] | ||
}} | }} | ||
<noinclude> | <noinclude> | ||
{{#widget:PDF | |||
|url=https://www.cl.cam.ac.uk/~sd601/papers/mov.pdf | |||
|width=900 | |||
|height=800 | |||
}} | |||
=References= | |||
<references/> | |||
Dolan's idea have been implemented with software. Christopher Domas<ref>{{:Video/reductio ad absurdum by Christopher Domas}}</ref> and Timo Denk<ref>{{:Web/MOV is Turing-Complete: 4-bit Adder Implementation}}</ref> has done so. | Dolan's idea have been implemented with software. Christopher Domas<ref>{{:Video/reductio ad absurdum by Christopher Domas}}</ref> and Timo Denk<ref>{{:Web/MOV is Turing-Complete: 4-bit Adder Implementation}}</ref> has done so. | ||
=References= | =References= | ||
Revision as of 16:26, 12 May 2022
Dolan, Stephen (July 19, 2013). "mov is Turing-complete" (PDF). local page: Computer Laboratory, University of Cambridge.
References
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.