This repo formalises the first result in the paper:
- Pingshi Yu, Chengsong Tan, Nicolas Wu, Alastair F. Donaldson: Complexity Theory of Randomised Testing. CoRR abs/2607.11811 (2026)
which states that GEN, the set of generable languages, is the same as RE, the set of recursively enumerable languages.