Turing completeness
Description: Turing completeness is the ability of a computational system to simulate a universal Turing machine and perform any computable task given sufficient resources.
Wikidata ID: wiki/Q197970
OpenAlex ID: keywords/turing-completeness
