 Such sequences need not be computable.On the other hand, the programs that act on these sequences "do" need to be computable in a reasonable sense.Computable functions are represented as programs on a Type 2 Turing Machine.