Turing completeness

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

References

Related Pages

• Universal Component
• Universality
• Monad
• Data
• Tensor