[Chart] We had 2981 unique visitors this November.
I think I saw this cow in my yard. He was floating over my pool. What does this means?
>>363
It means where wrong about UFOs.
I don't think it's supposed to be the there, op. I think you're a LIAR.
>>396
No, I think this is real because of global warming !
Cows cant fly, this thread is a bunch of fake ass lying faggots. I'm dissapointed in all of you for being so dishonest with yourselves and to other people. Shame on you all
A B B ! A Left ! Right Right A ! ★PUN★
A Right ! B Right ! Right Right -> A B !
Left ! Right ! Left ! Right ! Left ! Right A !
Right A ! A B ! Right Right Right -> A !
Left ! A ! Left ! A ! Left ! Right A !
Right A ! Left ! A ! Right A ! B A B A B ! A !
Right ! Right ! A Left ! A ! Right Left ! B !
Right B ! Right A ! B ! Right Right -> A !
A ! B ! A ! B ! A ! B B ! ★PUN★
A ! B ! A ! B ! A ! B !
A ! (What?!) A ! B ! A ! B ! A ! B ! A ! ★PUN★
A ! B ! A ! B ! A ! A ! A !
A Right ! B Right ! A ! Right A !
Right B ! B ! Left ! Left ! Right Right -> A ! ★PUN★
B ! A ! B ! A ! Right Left B ! ★PUN★
Right B ! Left ! A ! Right Right -> A !
Left A ! Left B ! Left ! Right A !
Right B ! A ! Left ! A ! Left ! Right A !
Right ! ! ! Left ! ! !
Right Left ! A !
Left ! Right A ! Right B !
Right Right -> A !
When I was a teenager, I hardly found anything cooler than the Y-combinator.
The Y-combinator is a mathematical construct in lambda calculus. You all know what a function is, right? Well, Alonzo Church came up with λ-calculus as an attempt to create a foundation for math starting from the simple concept of function. Instead, he ended up with a model for computation analogous to the more popular turing machine.
Now I don't want to get in too deep, but let me at least try explain what the Y-combinator does in brief.
In lambda calculus all functions are anonymous. This means that you cannot define a recursive function by making it call itself by name. So, to achieve recursion you need to pass the function to itself as an argument that it can then call. This is done by the Y-combinator function, that takes a function and returns the function called on the Y-combinator called on the function.
So, Y(g) = g(Y(g)) = g(g(Y(g))) = g(g(g(Y(g))))
See the recursion?
The Y combinator is defined as follows:
Y = λ f.(λ x.f(x x)) (λ x.f (x x))
Don't get it? Here's an actual explanation: https://mvanier.livejournal.com/2897.html
To the teen me, this DEPTH of concepts was inspiring and COOL... and I guess gurren lagann was cool too...
>>242
Shut the fuck up you permavirgin nerd
>>290
rude
>>242
Fucking nice I like Half life too
>>290
You're just too dumb to understand it!! you just don't get it. Also Im proud to be a virgin at my age since i'm not some guy like that.
>>293
I like Half life 2. Eeeeh get it? ha ha
my hobby is collecting misleading video ads of some shitty facebook game10 replies (and 4 file replies) omitted. Click here to view.
>>286
Post more, I love these they're hilarious
>>286
These ads are designed with the most braindead simple style and aesthetic in mind to appeal to kids. In 10-20 years this will be what they will feel nostalgic about. It's all going down the heckin' /sewer/ bros.
This ad features complicated moral choices
>>309
RAEP