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.
Primary topic: Computability, Logic, AI Algorithms (67%)
Wikidata ID: wiki/Q877945
OpenAlex ID: keywords/recursive-sets
