User blog:LittlePeng9/Creating fast-growing function

I'm going to try to create function which outgrows Goucher's Xi function. As for now, I have an idea of getting on par with Xi.

Brainf*ck
I think most of us heard about Brainf*ck. But instead of standard rules, I'm going to use following variant - machine has right-side infinite memory tape with data pointer starting on its left end. If pointer moves out of tape, program halts immediately. Program tape has same shape and has following symbols allowed: Now, memory tape is identified with input. Set of memory tape characters is same as program tape ones. We cycle them in order shown above. I think this isn't hard to see that we can emulate Turing machine with all this stuff (compare with Brainf*ck F by r.e.s.), so it is bounded by \(\omega_1^text{CK}\)
 * (blank) - standard blank character, ignored by program
 * > - move data pointer right
 * < - move data pointer left
 * + - cycle through symbols under data pointer (explained below)
 * [ - jump to after matching ] if data pointer is over blank cell
 * ] - return to matching [ if data pointer is over non-blank cell
 * 1) - halt

Oracle Brainf*ck
Coming soon