{"id":"https://openalex.org/keywords/recursive-sets","display_name":"recursive sets","description":"In computability theory, recursive sets are sets for which an algorithm always terminates and decides whether any given element belongs to the set.","display_name_alternatives":["computable set","decidable set","decidable sets","recursive set"],"ids":{"openalex":"https://openalex.org/keywords/recursive-sets","wikidata":"https://www.wikidata.org/wiki/Q877945"},"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.6739,"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.6739,"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/T11567","display_name":"semigroups and automata theory","score":0.1035,"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":202,"cited_by_count":4384,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/recursive-sets","updated_date":"2026-11-20T04:06:44","created_date":"2026-09-30T00:00:00"}
