{"id":"https://openalex.org/keywords/computational-completeness","display_name":"computational completeness","description":"A property of a formal computational system whose rules can express or simulate every computation in a specified universal model.","display_name_alternatives":[],"ids":{"openalex":"https://openalex.org/keywords/computational-completeness","wikidata":null},"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.54,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.54,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.2078,"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"}}],"works_count":438,"cited_by_count":5678,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/computational-completeness","updated_date":"2026-10-17T04:06:27","created_date":"2026-09-30T00:00:00"}