es
Feedback

¡No caigas en manos de tramposos! Telemetrio encuentra y marca estos canales 👉 Si quieres ver la etiqueta, suscríbete

meme tutorial

meme tutorial

Ir al canal en Telegram
4 594
Suscriptores
+324 horas
+107 días
+6130 días
Archivo de publicaciones
06 abr 2017, 05:39

06 abr 2017, 05:24

I have exactly half the followers of @ameribrit and exactly twice the followers of @cockypony
06 abr 2017, 04:54

06 abr 2017, 04:32

https://t.me/cockypony/3485 Did you mean: have a derivative? All algebraic functions have an derivative; however, they may not have an integral
06 abr 2017, 03:38

Which is why I am _not_ looking forward to quantum computing. Ever.
06 abr 2017, 03:35

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.
06 abr 2017, 03:34

https://t.me/cockypony/3478 Big enough keys for NP time: 2048-bit. Big enough keys for P time: several gigabytes.
06 abr 2017, 03:29

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.
06 abr 2017, 03:29

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..
06 abr 2017, 02:55

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.
06 abr 2017, 02:43

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.
06 abr 2017, 02:39

06 abr 2017, 02:32

06 abr 2017, 02:28

relevant meme
06 abr 2017, 00:27

06 abr 2017, 00:27

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

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
06 abr 2017, 00:16

They also like to say that taxation is theft; somehow I highly doubt they want to live in a country without taxes
06 abr 2017, 00:15

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
06 abr 2017, 00:14