Difference between revisions of "Move"
Jump to navigation
Jump to search
(Created page with "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 i...") |
m (Text replacement - "{{#ev:youtube |" to "{{#widget:YouTube |id=") |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
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. | 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<ref>{{:Video/reductio ad absurdum by Christopher Domas}}</ref><ref>{{:Paper/mov is Turing-complete}}</ref>. | ||
=The essence of a von-Neumann machine is the single instruction:[[Move]]= | =The essence of a von-Neumann machine is the single instruction:[[Move]]= | ||
{{# | {{#widget:YouTube | ||
|NmWwRmvjAE8 | |id=NmWwRmvjAE8 | ||
}} | }} | ||
<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> | ||
Latest revision as of 11:21, 26 August 2022
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
References
- ↑ Domas, Christopher (Aug 8, 2017). reductio ad absurdum by Christopher Domas. local page: Shakacon LLC Youtube Channel.
- ↑ Dolan, Stephen (July 19, 2013). "mov is Turing-complete" (PDF). local page: Computer Laboratory, University of Cambridge.