This user has mostly submitted to the following subverses (showing top 5):
22 submissions to CrashCourse
15 submissions to aoe2
8 submissions to cortex
7 submissions to nerdfighters
5 submissions to CGPGrey
This user has so far shared a total of 80 links, started a total of 22 discussions and submitted a total of 222 comments.
Submissions: This user has upvoted 454 and downvoted 34 submissions.
Comments: This user has upvoted 1499 and downvoted 51 comments.
5 highest rated submissions:
140+ comments on whether the God exists without a single holy war. Well done, Voat, submitted: 6/29/2015 6:49:53 AM, 74 points (+79|-5)
Do we really need to write "Edit: grammar" and "Edit: wording"?, submitted: 7/6/2015 12:25:33 PM, 19 points (+20|-1)
I identify as a goat. And I'm going to start contributing to Voat code. AMA!, submitted: 6/16/2015 6:17:14 PM, 18 points (+18|-0)
Not the Confederate Flag, submitted: 6/26/2015 9:40:10 PM, 16 points (+16|-0)
TIL if you find an algorithm to quickly solve sudoku, you'll instantly get $1 mln, help to cure cancer and basically blow everyone's mind (P vs. NP problem), submitted: 6/29/2015 10:26:01 PM, 14 points (+14|-0)
5 lowest rated submissions:
A website that tells you if you're awesome, submitted: 6/13/2015 12:13:49 PM, 1 points (+1|-0)
Sustaining Feudal Age Unit Production - Spirit Of The Law's take on modular gameplay, submitted: 6/14/2015 12:59:23 PM, 1 points (+1|-0)
/v/CrashCourse - CrashCourse YouTube channel discussion and community. Don't forget to be awesome!, submitted: 6/14/2015 1:02:17 PM, 1 points (+1|-0)
Zero to Hero: Dark Age [Age of Empires 2 Guide], submitted: 6/14/2015 11:33:10 AM, 1 points (+1|-0)
Zero to Hero: Feudal Age [Age of Empires 2 Guide], submitted: 6/14/2015 11:35:42 AM, 1 points (+1|-0)
3 highest rated comments:
dashie 0 points 42 points 42 points (+42|-0) ago
The P vs. NP problem.
The P vs. NP problem is one of the 6 unsolved Millennium Prize Problems, which means that you will get a million dollars if you solve it. It also means that it's basically one of the most important questions we have today.
P — set of all problems that you can reasonably quickly solve using a clearly defined algorithm. For example, add two numbers together.
NP — set of all problems for which you can reasonably quickly check if a solution is correct. For example, sudoku. It's much easier to check a solution for a 9x9 sudoku than it is to find it.
What's more important is that as the size of sudoku increases, it gets much harder to solve it much much faster than it gets to check a solution.
The question is: is P = NP? Is there a reasonably quick algorithm for sudoku that we aren't aware of, or is it really that hard and it's impossible to find one?
We don't know. And you can claim $1 mln if you know, because that's kind of a big deal.
I can expand on the definitions and why it's a big deal if you want, Voat. Edit: here you go!
First, here's a great explanation by hackerdashery: P vs. NP and the Computational Complexity Zoo [10:43]. My explanation is based on his, though I knew about the subject before, I just lack the eloquency. Please just watch it. It's as long as my explanation below but is much more awesome.
P — Polynomial. Polynomial is this:
x^2 + 4x + 4, or this:
x^3 + 10, or this:
x. Basically any math expression with variable(s) to some powers. And yes, that means
3 is a polynomial too, because
A problem is in P when it has an algorithm which solves it in polynomial time. For example, to find a minimal number in a list of N numbers, you need to just go through the list, which is N steps, and that's
— Well, that's confusing, because
x^2 doesn't seem like a reasonable amount of steps!
— It sure does when you consider
2^x, which is not a polynomial, and grows much faster! For example, at 10 items in a list
10^2 = 100, but
2^10 = 1024 which is 10 times more already!
NP — Non-deterministic Polynomial is a fancy name with a simple idea behind.
There was this guy, Alan Turing, who invented a computer, then created it, then helped to win WW2 with it, and also did some pretty impressive research in math.
Well, he didn't really invent the computer, and what he created was different from what he invented, but he defined a mathematical model of one to solve some math problems with it. It's called a Turing machine:
is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules.
In essence, a Turing machine is imagined to be a simple computer that reads and writes symbols one at a time on an endless tape by strictly following a set of rules. It determines what action it should perform next according to its internal "state" and what symbol it currently sees. An example of one of a Turing Machine's rules might thus be: "If you are in state 2 and you see an 'A', change it to 'B' and move left."
This kind of a Turing machine is called a deterministic machine — it's predefined and determined what the machine will do in any possible situation.
Another kind is a non-deterministic machine, which can have multiple different rules for the same situation: both "If you are in state 2 and you see an 'A', change it to a 'B' and move left" and "If you are in state 2 and you see an 'A', change it to a 'C' and move right".
How does it know what rule to choose? From Wikipedia:
There are two ways of looking at it. One is to say that the machine is the "luckiest possible guesser"; it always picks a transition that eventually leads to an accepting state, if there is such a transition. The other is to imagine that the machine "branches" into many copies, each of which follows one of the possible transitions. Whereas a DTM has a single "computation path" that it follows, an NTM has a "computation tree". If at least one branch of the tree halts with an "accept" condition, we say that the NTM accepts the input.
So NP in "P vs. NP" is a problem that has an algorithm that can solve it in polynomial time on a non-deterministic computer, which is fictional. You cannot be the luckiest possible guesser. But that usually means that there's at least an algorithm to check if a given solution is correct.
Currently all our data encryption works (e.g. HTTPS) on some simple mathematical operations chained in a way that's easy to calculate, easy to check if the result is correct, but practically impossible to revert back knowing the result.
The million dollar question is: is it possible for some genius hacker in his basement to create an algorithm to bypass such NP problem?
Oh, and by the way, it's possible to reduce NP problems to one another. There're also some NP problems in medicine, particularly in DNA research, so if you find a way to quickly solve sudoku, or to decrypt HTTPS (SSL), or anything similar, you will help to cure cancer, among other implications, such as changing our entire world view. Because naively one can think that if P = NP, then everybody who has a piano can reasonably fast create a new symphony, and everybody with a piece of paper can "luckily guess" a painting.
But we don't know if it's possible. Maybe it's not, and P is not NP.
Also, P vs. NP can be thought of as an NP problem, so it should be easy to solve. Or not. We don't know!
Edit: grammar. English is my second language, so please tell me if there're mistakes because I can't recognize them, I'm basically at a 15 year old level in this regard.
Edit 2: minor factual errors.
dashie 0 points 22 points 22 points (+22|-0) ago
I'm pretty sure OP meant it as a metaphor for the inside culture in general.
"Someone, do something memorable!"
3 lowest rated comments:
dashie 0 points 0 points 0 points (+0|-0) ago
And you totally deserve it. Good job, humanity.