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

From PKC
Jump to navigation Jump to search
Line 3: Line 3:
|first1=Stephen
|first1=Stephen
|last1=Dolan
|last1=Dolan
|url=https://www.cl.cam.ac.uk/~sd601/papers/mov.pdf
|url=https://drwho.virtadpt.net/files/mov.pdf
|date=July 19, 2013
|date=July 19, 2013
|publisher=Computer Laboratory, University of Cambridge
|publisher=Computer Laboratory, University of Cambridge

Revision as of 16:28, 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.