by porcupine_ February 6, 2021
Get the Fasterly mug.Guy1: Man, that product was so fast and cheap to use!
Guy2: Damn, it was that fast and cheap? That sounds like my hooker!
Guy2: Damn, it was that fast and cheap? That sounds like my hooker!
by CUMSE February 22, 2021
Get the fast and cheap mug.Related Words
feast
• feastiality
• Feast or Famine
• feaster
• feastival
• Feasty
• feastable
• Feastee
• Feasterville-Trevose, Pa
• feastin
That speedy guy or girl who attempts to know everything about his current car but fails badly. Often drives cars with 120bhp or more. Kinda does burnouts but he do still be learning cuz he or she be scared of doing the skyline dirty like that.
by theFASTFAGG November 23, 2021
Get the fastfagg mug.When you take your girl out to breakfast, after you pre maturely nut. Because she told you it’s not gonna work out
Teddy pulled a fast Gavin on his girl farquan after he butter in his underwear while she was riding him slowly
by Quick Gavin February 5, 2022
Get the Fast Gavin mug.Girl: you never wanna hangout you’re a terrible friend
Guy: you accused me of being a bad friend, you fast ass bitch
Guy: you accused me of being a bad friend, you fast ass bitch
by Dannydavito December 28, 2021
Get the Fast ass bitch mug.FFF is when every day for this month you masturbate until you can ejaculate. You time how long it took to ejaculate and at the end of the month you compare and look for the fastest time you can ejaculate. Basically a speedrun to cum.
Person 1: Dude, you know it's Fast Fap February, how fast did you cum?
Person 2: It took me 20 seconds
Person 1: Damn it took me 5 minutes
Person 2: It took me 20 seconds
Person 1: Damn it took me 5 minutes
by Yomamaha January 5, 2022
Get the Fast Fap February mug.The fast growing hierarchy (shortened to FGH) is a method of defining large numbers. It takes in two inputs.
We define f(0,n) = n+1. For example: f(0,3) = 4. Next step is iteration. f(1,n) is f(0,f(0...f(0,n)...)) where f(0,...) is iterated n times. For example, f(1,2) = f(0,f(0,2)) = 4. Same rules for f(m,n).
Now let's define what ordinals are. Very simplified, they're a kind of infinity.
Consider this: |||....|
This has infinite sticks, but there's a 1st stick, 2nd stick... the last stick is the ωth stick. You can have ω+1, ω+2, ω+3 etc too. For our purposes, a limit ordinal is an ordinal that has no finite part at the end (so ω+3 is not a limit ordinal but ω×3 is.).
So how can we use this within FGH? We need to define a fundamental sequence (FS). An FS is the steps we take to reach a new limit ordinal. So the FS for ω is 0,1,2... and for ω×2 it's ω,ω+1,ω+2...
We can write this as: ωn = n, ω×2n = ω+n, ω^2n = ω×n and so on. There are more ordinals, but it'll do for our purposes.
This is not the only system for an FS. There's more, but I cannot fit it in an entry.
Now consider an ordinal α. Now FGH can be defined concretely:
for f(α,n):
if α is 0, it is n+1.
if α is not a limit ordinal, it is f(α-1,f(α-1...f(α-1,n)...)) where f(α-1,...) is iterated n times.
if α is a limit ordinal, it is f(αn,n).
Let's do an example: f(ω,3) = f(3,3) = f(2,f(2,f(2,3))). I know that f(2,n) = n×2^n, so it's 1.804356 × 10^15151336, which is HUGE! Imagine how large f(ω,10) is.
We define f(0,n) = n+1. For example: f(0,3) = 4. Next step is iteration. f(1,n) is f(0,f(0...f(0,n)...)) where f(0,...) is iterated n times. For example, f(1,2) = f(0,f(0,2)) = 4. Same rules for f(m,n).
Now let's define what ordinals are. Very simplified, they're a kind of infinity.
Consider this: |||....|
This has infinite sticks, but there's a 1st stick, 2nd stick... the last stick is the ωth stick. You can have ω+1, ω+2, ω+3 etc too. For our purposes, a limit ordinal is an ordinal that has no finite part at the end (so ω+3 is not a limit ordinal but ω×3 is.).
So how can we use this within FGH? We need to define a fundamental sequence (FS). An FS is the steps we take to reach a new limit ordinal. So the FS for ω is 0,1,2... and for ω×2 it's ω,ω+1,ω+2...
We can write this as: ωn = n, ω×2n = ω+n, ω^2n = ω×n and so on. There are more ordinals, but it'll do for our purposes.
This is not the only system for an FS. There's more, but I cannot fit it in an entry.
Now consider an ordinal α. Now FGH can be defined concretely:
for f(α,n):
if α is 0, it is n+1.
if α is not a limit ordinal, it is f(α-1,f(α-1...f(α-1,n)...)) where f(α-1,...) is iterated n times.
if α is a limit ordinal, it is f(αn,n).
Let's do an example: f(ω,3) = f(3,3) = f(2,f(2,f(2,3))). I know that f(2,n) = n×2^n, so it's 1.804356 × 10^15151336, which is HUGE! Imagine how large f(ω,10) is.
by cyclopentane December 1, 2022
Get the Fast Growing Hierarchy mug.