Also known as Turing-recognizable
a formal language that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).