{"id":"https://openalex.org/keywords/turing-completeness","display_name":"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.","display_name_alternatives":["computationally universal","Turing complete"],"ids":{"openalex":"https://openalex.org/keywords/turing-completeness","wikidata":"https://www.wikidata.org/wiki/Q197970"},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.1774,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.1764,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.1035,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":1229,"cited_by_count":12910,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/turing-completeness","updated_date":"2026-11-16T04:05:30","created_date":"2022-04-12T19:38:12"}
