Turing completeness
(Redirected from Turing complete)
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.
References