I think it's time for me to sleep. See you!

Are traps gay?
No: 0
Yes: 13

Should say that the poll is rigged (as a joke, obviously) and actual results are 4 yes / 4 no

But honestly by the time I'm interested in what's in someone's pants I don't care what I find there.

https://t.me/grumpy_mumbles/8870
Because god forbid you help someone because you're a decent fucking human being. I was once told "kill myself, you fucking communist" because I offered to help my friend with money. I swear, these people are the most obtuse pieces of shit imaginable

They also like to say that taxation is theft; somehow I highly doubt they want to live in a country without taxes

I have no clue how much of their online activity is trolling, but I highly hope it's at least 80% because the opinions that they spout endless dumbfound me entirely

https://t.me/grumpy_mumbles/8881
Oh yeah, of course they also target people who they know are not going to take arguments well

relevant meme

For those who don't get it:
The Travelling Salesman problem requires you to visit each city once, and have it be the shortest possible path. As of right now, the problem is solvable, but only in non-polynomial time - which means that as you add more cities, the amount of time it takes to compute the path grows exponentially - which is insanely fast.

To put it in perspective, if you have N computers solving a polynomial-time problem, it will be solved in a 1/N of the time that it takes for a single computer - so, the processing time is basically halfed every time you double the amount of computers.

If you have a single computer solving an exponential-time problem, and you add another computer, it'll get solved, say, a second faster. As you add more computers, you'll only shave off single seconds.

This is also why P=NP is a big deal - if you can prove that every single problem that can be checked efficiently can also be solved efficiently, you can do stuff like protein folding (that's a cure for cancer!), and solve a lot of currently unsolved math problems. However, you kinda also break encryption completely and forever, so that's kind of a tradeoff..

https://t.me/cockypony/3476
All encryption (AES, elliptic-curve, etc.) is based on the fact that while it is possible to decrypt the message without knowing the key, it will take the attacker several lifetimes before cracking it.

https://t.me/cockypony/3478
Big enough keys for NP time: 2048-bit.
Big enough keys for P time: several gigabytes.

You could argue that by the time we're gonna solve this we'd be juggling petabytes and probably living in fully automated luxury gay space communism, but I'm hoping that actually working out the algorithm would take a long while.

Which is why I am _not_ looking forward to quantum computing. Ever.