Remember in the post about the fast and slow growing hierarchies, I talked about Bird's Array Notation, or BAN? Today it's that! I was thinking of doing BEAF or Conway's chained arrow notation, but this felt more reasonable. If this is confusing, go check out this link to make it EVEN MORE confusing. There are … Continue reading Birb will like this
Happy (not really) Pi Approximation day!
As a tau-believer, I don't really enjoy posting about pi and such, so I'll make this quick. There are approximations for pi, rational approximations that try and estimate pi, and they're basically different numbers, and 22/7 = 3.142857..., accurate to two digits beyond the decimal point. Happy Pi Approximation day!
It’s the not fast-growing hierarchy!
What is the slowest growing function ever? How do you represent it? With slow-growing hierarchy.
I don’t think you have any idea how fast I am
I'm fast as fΓ0(n) boi What on Earth is fΓ0(n)? Remember the last post, Fast as (insert word here) boi, where I talked about the fast-growing hierarchy? These are just extensions on it. Let's take a step down. Do you remember ω? The ordinal that used the diagonal of the hierarchy table? (I'll be completely … Continue reading I don’t think you have any idea how fast I am
Fast as (insert word here) boi
You guessed it: fast-growing hierarchy! On Wikipedia and the Googology Wikia, it's complicated and long and boring and zzZZZZZZ... so I'll try my best to simplify it. Define a function, f0(n) = n + 1. It doesn't grow so fast, does it? For fa(n), that is fa-1n(n), where that denotes doing the previous function n … Continue reading Fast as (insert word here) boi
Fish number 3.
We're doing this again! I'm skipping Fish Number 2 because I'm really confused by it. I'll do it next time. Remember Fish Number 1? With the S and SS map? We have to define a new map. The s(n) MAP! This is mainly just copied from the Googology Wikia. Define s(n) map as: s(1)f := … Continue reading Fish number 3.
Feesh number1
Who loves fish? If you do, YOU'LL LOVE THIS! jk but this number is still huge, but smaller than Rayo's number.
Don’t ask this particular beaver to do your work for you.
Busy beavers and Turing machines and big numbers and ... what.
One amazing step for man…
This is a really big step. RAYO'S NUMBER. It's defined as Rayo(10^100). For all I know, it might end with 7. What is Rayo(n)? So you see, there used to be this battle at MIT named THE BIG NUMBER DUEL The duel was not a fighting duel. No! This duel was to see which person … Continue reading One amazing step for man…
xkcd
Funny incoming. And also, xkcd is here. And no, I don't know if that number is involved in this. Remember Graham's number? Let's call it G. I'll have to define something. Ackermann's function. If you know this, then great! If not, then here it is. Wilhelm Ackermann created a function named after himself. The function … Continue reading xkcd

