Non-RE Languages o suppose the set of all languages is countable o list characteristic vectors of all languages according to the bijection f n f(n 10101010 21010011 31110001 40100011Non-RE Languages  suppose the set of all languages is countable  list characteristic vectors of all languages according to the bijection f: n f(n) _ 1 0101010… 2 1010011… 3 1110001… 4 0100011… …