{"id":"https://openalex.org/keywords/program-size-complexity","display_name":"program-size complexity","description":"Program-size complexity is a measure of the shortest program or description needed to generate an object, central to algorithmic information theory.","display_name_alternatives":[],"ids":{"openalex":"https://openalex.org/keywords/program-size-complexity","wikidata":"https://www.wikidata.org/wiki/Q1456811"},"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.8345,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.8345,"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.1178,"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":116,"cited_by_count":2437,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/program-size-complexity","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
