Paper/mov is Turing-complete

From PKC
Revision as of 14:16, 1 September 2021 by Benkoo (talk | contribs)
Jump to navigation Jump to search

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

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