Paper/mov is Turing-complete

From PKC
Revision as of 08:02, 13 January 2024 by Bkoo2 (talk | contribs) (Text replacement - "{{#ev:youtube|hP3ENPc8Jf0 |width=900 |height=500 }} " to "{{#widget:YouTube |id= hP3ENPc8Jf0 |width= 900 |height=500 }}")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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=40427"