Difference between revisions of "Turing completeness"
Jump to navigation
Jump to search
(Created page with "Turing completeness is a condition where given unlimited time and space resources, all algorithms can be implemented using a single instruction called: move.") |
|||
| Line 1: | Line 1: | ||
Turing completeness is a condition where given unlimited time and space resources, all algorithms can be implemented using a single instruction called: [[move]]. | Turing completeness is a condition where given unlimited time and space resources, all algorithms can be implemented using a single instruction called: [[move]]. | ||
<noinclude> | |||
=References= | |||
<references/> | |||
==Related Pages== | |||
*[[Definition::Universal Component]] | |||
*[[Definition::Universality]] | |||
*[[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]] | |||
</noinclude> | |||
Latest revision as of 06:45, 3 September 2021
Turing completeness is a condition where given unlimited time and space resources, all algorithms can be implemented using a single instruction called: move.
References