Turing complete languages rarely vary much. If you take the string domain to be binary data, and compare most major programming languages, there will probably be a high between the lengths of equivalent programs.
Any language for which description of 30000 zero bits is longer than say, 30000 bits with zero-separated prime-length clusters of one bits (110111011111011111110...) is not general purpose.
Turing complete languages rarely vary much. If you take the string domain to be binary data, and compare most major programming languages, there will probably be a high between the lengths of equivalent programs.
Any language for which description of 30000 zero bits is longer than say, 30000 bits with zero-separated prime-length clusters of one bits (110111011111011111110...) is not general purpose.