Turing completeness

From PKC

Revision as of 06:43, 3 September 2021 by Admin (talk | contribs) (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.")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Turing completeness is a condition where given unlimited time and space resources, all algorithms can be implemented using a single instruction called: move.

Retrieved from "https://pkc.pub/index.php?title=Turing_completeness&oldid=11398"