Geoffrey Hinton, on the Chain Rule (from Neural Networks for Machine Learning, Coursera)

College in one gif

Yes it is, Dexter!

Mister Doctor Professor Zoom?

I can’t stop making these, they make me laugh so much lol!

what do u want from me

Good luck to everyone doing their exams

What.

I knew this day was coming.

It’s been 6 generations and this guy is still tripping balls over science and technology. 

[slides nasa $20] so, tell me about the aliens

aliens: [slide nasa $40]

nasa: lmao what aliens

Graph of the number of times, N(n), that an integer, n, appears in Sloane’s Online Encyclopedia of Integer Sequences, from a paper by Nicolas Gauvrit, Jean-Paul Delahaye, and Hector Zenil. The graph is approximately exponential in n, N(n) ≈ k * n-1.33, which is predicted by the algorithmic complexity of the integers n. There’s a visible gap, which the authors call “Sloane’s Gap”, separating clouds of “more interesting” and “less interesting” numbers. Many of the “more interesting” numbers are squares, primes, and numbers with many factors.

(via mathoverflow)

I can’t make gifs/too lazy, but this is important.