Worked Solutions 1 - enumerability

of letters. We can therefore infer that the set of programs is enumerable. By contrast, the set of all functions N → N is non-enumerable (see lectures). So there is no surjective map from programs to functions (if there were, then the set of functions would be enumerable). In particular, the map that takes ................
................