Difference between revisions of "Move"

From PKC
Jump to navigation Jump to search
Line 7: Line 7:
}}
}}


<noinclude>
=References=
=References=
<references/>
<references/>
==Related Pages==
==Related Pages==
*[[Definition::Universal Component]]
*[[Definition::Universal Component]]
*[[Definition::Universality]]
*[[Definition::Universality]]
*[[Definition::Monad]]
*[[Definition::Monad]]
*[[Logically related::Data]]
*[[Logically related::Tensor]]
[[Category:Process]]
[[Category:Measurement]]
[[Category:Proportion]]
[[Category:Scale]]
[[Category:Scale-free]]
[[Category:Symmetry]]
[[Category:Invariance]]
[[Category:Assessment]]
[[Category:Verification]]
[[Category:Validation]]
[[Category:Motivation]]
[[Category:Category Theory]]
[[Category:Category Theory]]
</noinclude>
</noinclude>

Revision as of 06:45, 3 September 2021

Move is the only computing instruction necessary to achieve universality or so called Turing completeness. There are quite a few papers and videos on this. They can be found in references[1],[2].


The essence of a von-Neumann machine is the single instruction:Move

{{#ev:youtube |NmWwRmvjAE8 }}


References

  1. Domas, Christopher (Aug 8, 2017). reductio ad absurdum by Christopher Domas. local page: Shakacon LLC Youtube Channel. 
  2. Dolan, Stephen (July 19, 2013). "mov is Turing-complete" (PDF). local page: Computer Laboratory, University of Cambridge. 

Related Pages