Difference between revisions of "Paper/mov is Turing-complete"

From PKC
Jump to navigation Jump to search
Line 11: Line 11:
<noinclude>
<noinclude>
{{#widget:PDF
{{#widget:PDF
|url=https://www.cl.cam.ac.uk/~sd601/papers/mov.pdf
|url=https://drwho.virtadpt.net/files/mov.pdf
|width=900
|width=900
|height=800
|height=800

Revision as of 16:27, 12 May 2022

Dolan, Stephen (July 19, 2013). "mov is Turing-complete" (PDF). local page: Computer Laboratory, University of Cambridge. 


Currently your browser does not use a PDF plugin. You may however download the PDF file instead.

References

Dolan's idea have been implemented with software. Christopher Domas[1] and Timo Denk[2] has done so.

References

  1. ↑ Domas, Christopher (Aug 8, 2017). reductio ad absurdum by Christopher Domas. local page: Shakacon LLC Youtube Channel. 
  2. ↑ Denk, Timo (December 17, 2017). "MOV is Turing-Complete: 4-bit Adder Implementation". local page: Timo Denk's blog. 


Retrieved from "https://pkc.pub/index.php?title=Paper/mov_is_Turing-complete&oldid=30211"