Turing Completeness
Easy
Turing completeness refers to the capability of a system or programming language to solve any problem that can be solved by a machine created by mathematician Alan Turing.
Turing completeness refers to the capability of a system or programming language to solve any problem that can be solved by a machine created by mathematician Alan Turing.