r/googology • u/[deleted] • Nov 05 '19
Weird function needs analysing!
So I made a function, call it f for simplicity's sake, which takes an ordered n-tuple of non-negative integers as an input. It's defined by the following (albeit convoluted) iteration:
f(n) := n+1
f(a_1, ... , a_n) := f[ (a_1) -1, b_2, b_3, ... , b_n ] +1
b_i := f(a_1, ... , (a_i) -1, ... , a_n) +1
if one of the terms in the n-tuple a_i = 0, remove the term (making the n-tuple into an (n-1)-tuple) and increment all following non-zero terms in the tuple by 1, then add 1 to the whole function, like this:
f(a_1, ... , a_(i-1), 0, a_(i+1), ... , a_n) := f(a_1, ... , a_(i-1), a_(i+1) +1, ... , a_n +1) +1
(This step is done simultaneously - if there are multiple zero terms, DO NOT increment terms that are also zero. ONLY increment non-zero terms)
f(0, 0, ... , 0) := 1
The definition in text form:
If the input n-tuple has length 1, output the input incremented by 1.
If the input n-tuple has length >1 but 1 or more of the terms in the tuple are 0, then for each individual 0 term do the following, before incrementing the whole function itself by 1:
Increment all non-zero terms to the right of this term by 1.
Remove this term from the tuple entirely.
If the input n-tuple has length >1 and all terms are non-zero, evaluate the function again using a new n-tuple, whose terms are defined by the following:
The 1st term is the same as before, but decremented by 1.
The i-th term (1 < i <= n) in the new input tuple is itself an evaluation of f on the original tuple, with the i-th term in the original tuple decremented by 1, then this whole term is incremented by 1.
Increment this whole new function evalution by 1.
So, now that we've got the definition out of the way, we can look at the smallest possible case, where we only feed the function tuples of the form (1, 1, ... , 1):
f(1) = 1+1 = 2
f(1, 1) = f[ 0, f(1, 0) +1 ] +1 = f[ f(1,0) +2 ] +2 = f[ f(1) +3 ] +2 = 8
f(1, 1, 1) = f[ 0, f(1, 0, 1) +1, f(1, 1, 0) +1 ] +1 = ... = f(16, 11) = don't even bother trying to calculate this
The value of f(1, 1, 1) is something which I believe involves the number 5, and the operation ^16 (up-arrows, "octadecation"?), which is stupidly large. I wonder how this function grows, anyone wanna help me analyse this? It feels like it might have some interesting properties.
Things I Worked Out:
f(1, n) = 5n +3
f(2, n) = 6*(5n) -1
f(3, n) = [involves tetration]
f(n, 1) = f(n-1, n+3) +1
f(n, 2) = [involves exponentiation to the degree ~f(3, k_3) where k_3 is of the order ~f(4, k_4) ... to k_(n-1)]
EDIT 1: corrected errors in my workings - results should now be correct / more accurate.
EDIT 2: rewrote the general definition formula at the top to be a little clearer by adding another line of formulae.
EDIT 3: fixed f(2,n) (again)
2
u/YtoSk Apr 22 '20
I'm not sure about anything after ω+1, but here's my analysis:
f(0,n)=f(n+1)+1=n+3
f(1,n)=f(0,f(1,n-1))=f(1,n-1)+3=f(1,0)+3n=3n+4
f(2,n)=f(1,f(2,n-1))=3f(2,n-1)+4=3(3(...(5)...)+4)+4=3n +Σ_(i∈n+1) 3n *4≈3n+1
f(3,n)≈E[3]7#n≈f_3(n)
f(m,n)≈f_m(n)
f(1,1,n)=f(f(1,n+1)+2,f(1,1,n-1)+1)+1≈f_(3n+9)(n)≈ω
f(1,2,n)=f(f(1,1,n)+1,f(1,2,n-1)+1)+1≈f_ω(f_ω(n))
f(1,n,n)≈ω+1
f(2,1,n)=f(1,f(2,n+1)+1,f(2,1,n-1))≈ω+2
f(2,n,n)≈ω+3
f(m,1,n)≈ω+2m-2
f(1,1,1,n)≈ω2
f(2,1,1,n)≈ω2+2
f(1,1,1,1,n)≈ω3
f(1,1,1,...,1,1,n) with n 1s≈ω2
It seems kinda weak. Your notation is as strong as 4-entry BAN, or (0)(1)(2)(2) in BMS.
1
3
u/IronMaidenFan Nov 06 '19
Following your examples on f(2,n) and f(n,2) for a case of f(2,2) i get 2 different results. I will try and look into it, you should too.