Also known as busy beaver problem
a halting, binary-alphabet Turing machine which writes the most 1s on the tape, using only a limited set of states
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).