Finally :) Goosebumps and smiles did take me over but man, the animation was below average. I don't frequent the anime so maybe I'm not used to Toei's animation standards. In recent times, I've only watched Megumi Ishitani's episodes so was expecting something of that quality for this as well.
Hey, I had posted the view a few days back :) That was taken half a decade ago. Is this a recent pic? Has the restaurant undergone any major change since then or is it still the same? Would love to visit Trondheim again in the future, this time in winter though to enjoy Aurora Borealis.
As I said, it's a meme on the mathematical concept of random/drunkard walk. It's not "wrong" given certain assumptions. For 2D, as the number of steps taken by a drunk tend to infinity, the probability of reaching the origin tends to 1:
Real drunks don't walk in pure 2D plane well of course they don't, they don't get infinite number of steps either. No need to take this so seriously. We all happily ignored the air resistance in physics class back in the day didn't we? :)
It's a "shower thought" lol, not a research paper. Take it as a meme on random walk, which is always explained in universities using the example of a drunk guy so much so that it's also known as "drunkard's walk". Should've posted this in a science/physics meme community, my bad.
I had done the same. Was on DDG for around 2 years but shifted to Brave search recently. Results are almost on par with DDG I'd say but the main highlight for me is their AI summarizer. Pretty accurate and often I don't even have to visit any website. Also like their discussions tab.
As you said, we have infinite numbers so the fact that something works till 4x1018 doesn't prove that it will work for all numbers. It will take only one counterexample to disprove this conjecture, even if it is found at 10100. Because then we wouldn't be able to say that "all" even numbers > 2 are a sum of 2 prime numbers.
So mathematicians strive for general proofs. You start with something like: Let n be any even number > 2. Now using the known axioms of mathematics, you need to prove that for every n, there always exists two prime numbers p,q such that n=p+q.
Would recommend watching the following short and simple video on the Pythagoras theorem, it'd make it perfectly clear how proofs work in mathematics. You know the theorem right? For any right angled triangle, the square of the hypotenuse is equal to the sum of squares of both the sides. Now we can verify this for billions of different right angled triangles but it wouldn't make it a theorem. It is a theorem because we have proved it mathematically for the general case using other known axioms of mathematics.
Major one for me is their software. No matter the cost, I don't think an Operating System should be crafted in a way that sneakily consumes user data and delivers ads to the user by default. Not on the lockscreen, not in the notification tray, not in the system apps like the file browser. Also, transmitting requests in incognito mode to their servers by default, can you really trust them?
Gogo Sempai @ gogosempai @programming.dev Posts 23Comments 141Joined 2 yr. ago
ALWAYS be careful of the disk names you give to dd as input.