{"id":"https://openalex.org/keywords/busy-beaver-function","display_name":"Busy Beaver function","description":"A function in computability theory giving the maximum number of symbols a halting Turing machine can write, subject to a limit on its states.","display_name_alternatives":["busy beaver","busy beaver problem"],"ids":{"openalex":"https://openalex.org/keywords/busy-beaver-function","wikidata":"https://www.wikidata.org/wiki/Q1427965"},"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.837,"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.837,"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/T12516","display_name":"Advanced Mathematical Theories and Applications","score":0.0781,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":209,"cited_by_count":614,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/busy-beaver-function","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
