# Recursive unpacking of programs

One idea that we have been following is the idea of simple but deep sequences. Simple in terms of Kolmogorov complexity and deep in terms of logical depth, i.e. long computation time. In order to flesh out our idea of recursive unpacking as the contrary operation to recursive compression, it’d be interesting to construct a Turing machine that reads a program, writes an output and reuses that output as a program to generate the next output an so on.