In computability and complexity theory, all problems are reduced to language recognition, where a language is defined as a set of strings over some alphabet, typically {0, 1}. For example, L1 = {10, 11, 101, · · · } is the language that contains all prime numbers, represented in binary. Then the problem of determining whether or not a number x is a prime is the same as determining whether or no...
