My Attempt at making a very fast growing program! This is simple. However, it is very fast growing! The Limit of 0 entries, ()()...()[n]=(0)(1)[n] grows at 2n, so it double. The Limit of 1 entry, (0)(1)...(n)[n]=(0,0)(1,1)[n] grows at f_ε(0) (n) in FGH. Immediately, it destroys Graham's number, and an unthinkable amount of numbers. But that is just the beginning The Limit of 2 entries, (0,0)(1,1)...(n,n)[n]=(0,0,0)(1,1,1)[n] grows at f_Ψ(Ω(ω)) (n), so it is REALLY fast! The Limit of 3 entries, (0,0,0)(1,1,1)...(n,n,n)[n]=(0,0,0,0)(1,1,1,1)[n] grows at f_Ψ(Ψ_I(ω,0) (0)) (n), so it is extremely fast! The limit of n entries, (0,0...,0)(1,1...,1)[n] grows so fast, that the growth rate remains a mystery... More info: http://googology.wikia.com/wiki/Bashicu_matrix_system
