Sometimes a simpler language beats one with problem specific primitives. For instance, Haskell is well equipped to do a short prime number generator with nubBy

Sometimes a simpler language beats one with problem specific primitives. For instance, Haskell is well equipped to do a short prime number generator with nubBy(((>1).).gcd)[2..] where nub removes duplicates from a list according to some notion of equivalence, which in this case is having a greatest common divisor greater than one. That's just 23 bytes. Can we beat that with a language with no such arithmetic and list support? It can in fact be beaten with a language that has no built-in numbers, let alone arithmetic. This 167 bit Binary Lambda Calculus [1] program 0011010100010100010100010000010100000100010100010000010000010100000100010100000100010000010000000100 produces the infinite characteristic sequence of primes. [1] https://tromp.github.io/cl/Binary_lambda_calculus.html#Complexity_of_Sets https://tromp.github.io/cl/Binary_lambda_calculus.html#Compl...