User blog comment:QuasarBooster/The Wackermann function/@comment-43798125-20200217140929/@comment-24923514-20200217155113

As P-bot said, it would be possible to Gödel encode a list of natural numbers, if incredibly messy. Personally, I haven't been able to come up with a satisfactory method that's simple for both encoding and decoding.

For example, you could encode [a_1,a_2,...,a_n] as prod_(k=1)^n (p_k)^(a_k) where each p_k is prime. But theres not an easy way to retrieve any a_k without constantly checking how many times the code is divisible by a certain prime.