Turing-completeness
idea
A property of a computational system that can simulate any Turing machine, meaning it can solve any problem that a computer can solve.
Also Known As
Turing-completeness
No ranking data available
A property of a computational system that can simulate any Turing machine, meaning it can solve any problem that a computer can solve.