Random
Source Code
Random
A annoying catchphrase said by that ball of blue fluff sonic
Sonic: got to go fast ! (Races of into the distance)
Tails: fuck of.
6👍 3👎
A wannabe cowboy who is two-faced and a bit of a wanker.
look at fast hand paul, he is such a bitch bag.
5👍 3👎
When a man will put a significant amount of time making you feel like you’re the one that got his heart, that you’ll never be apart and loves you unconditionally and then on random occasions he will start a fight out of no where claiming unrealistic innuendos of you cheating on him so that he can block you and disappear for two days or more to play video games with his friends and entertain all the other women he pulls this same move on. And when he’s gone through the full rotation of females he’s got on his roster, watched all the porn he can handle, and played countless hours of NHL hockey on PlayStation he will casually text you as if nothing ever happened and work his charms to get back into your life. He will play head games with you and confuse you to the point of insanity because of how obsessive you become. He often rides a motorcycle for quick getaways so you cannot follow him to see where he goes.
Hey girl, are you ok? I heard John pulled a Fast Eddie on you.
1👍 6👎
A place that serves "home cooked" food in 12 minutes or less. Not a food cart.
I only have 30 minutes but I want some good fast-slow food.
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.
Graham's Number is approximately equal to f(ω+1,3) within the Fast Growing Hierarchy.
1👍 1👎
When you and your spouse say you are going to eat healthy together and then one of you eats fastfood in secret
It was only 2 weeks into the new year and I committed fast food adultery behind my wives back.
Refers to a Tool Assisted Speedrun (TAS) of a Sonic game.
The TAS gave a new meaning to Gotta Go Fast.