Back to Epicmafia

3rd best player ever

deletedabout 7 years

no.1 and 2 is obviously between maxwell and myself (i'm no.1)

poll includes the top candidates for the next best.

who's the better player
6
Crypto
6
Gira
2
Fantastic
2
Soben
1
Jaguar
shady12
about 7 years

shady12 says

Yeah the million dollar challenge seems much more difficult, if not impossible. More about computer processing power. No efficient algorithm.



Recidivism says

It's not impossible, it's very possible.



shady12 says

paragraph response



Recidivism says

No, you're absolutely wrong, it's definitely possible. They think it would take a top-tier program 1,000 years, but that isn't impossible.

shady12
about 7 years
Dude.. I'm not trying to intentionally mislead anyone. That is word for word how it went down, I wasn't even trying to argue until you fervently disagreed.
deletedabout 7 years
Nice dude I am proud of you for intentionally misleading people as to what I said in order to flaunt your understanding of computer science, how else will they know that you know computer science? I get it. Sometimes I link youtube videos that aren't very relevant, it's pretty much the same thing.
shady12
about 7 years
I still stand by that statement, which you disagreed with and has been the main disagreement this entire time.
shady12
about 7 years
And the million dollar challenge may very well be impossible. Hopefully someone proves it one way or the other.
deletedabout 7 years

Recidivism says


Tatami says


Recidivism says

It's not impossible, it's very possible.


This is completely wrong.



Recidivism says

No, you're absolutely wrong, it's definitely possible. They think it would take a top-tier program 1,000 years, but that isn't impossible.


Never did I say that the problem had an efficient solution, hell if I know, I don't program.

Congrats on knowing computer science though, shady. Too bad you can't read.

deletedabout 7 years
Right okay you're right, I never disagreed with that nor do I actually understand computer science, nor did I ever claim that I understand computer science.

All I said is that it is possible to solve.
shady12
about 7 years
I'm just trying to explain that finding a solution to the puzzle is not worthy of the million dollar prize, but that the n-Queens problem is an example of the larger P=NP problem. So to have a shot at the million dollars you would have to solve the problem using an efficient algorithm (which would then be applicable to other problems like the n-Queens).
deletedabout 7 years

Tatami says


Recidivism says

It's not impossible, it's very possible.


This is completely wrong.



Recidivism says

No, you're absolutely wrong, it's definitely possible. They think it would take a top-tier program 1,000 years, but that isn't impossible.


Never did I say that the problem had an efficient solution, hell if I know, I don't program.

Congrats on knowing computer science though, shady. Too bad you can't read.
deletedabout 7 years

AdrenalineMime says


shady12 says


Recidivism says

It's not impossible, it's very possible.


What are you talking about? Writing an algorithm that solves the puzzle? Easy. Writing an algorithm that solves the puzzle in polynomial time? Well that gets tricky. It exists in the NP subset of problems (a solution can be verified as correct or incorrect in polynomial time), but a recent German thesis proved (though may be disproven) that P (subset of all problems that can be solved in polynomial time) =/= NP, which means that this puzzle may not be solvable in polynomial time at all.





And I didn't respond to that, because that was correct.
deletedabout 7 years
I feel like you just chose not to read what I typed in order to flaunt the fact that you understand computer science, which was entirely irrelevant to my post.
AdrenalineMime
about 7 years

shady12 says


Recidivism says

It's not impossible, it's very possible.


What are you talking about? Writing an algorithm that solves the puzzle? Easy. Writing an algorithm that solves the puzzle in polynomial time? Well that gets tricky. It exists in the NP subset of problems (a solution can be verified as correct or incorrect in polynomial time), but a recent German thesis proved (though may be disproven) that P (subset of all problems that can be solved in polynomial time) =/= NP, which means that this puzzle may not be solvable in polynomial time at all.

deletedabout 7 years

Recidivism says

No, you're absolutely wrong, it's definitely possible. They think it would take a top-tier program 1,000 years, but that isn't impossible.


Can you simply not read?
shady12
about 7 years

Recidivism says

I didn't say an efficient algorithm exists. I said the problem can be solved, given 1000 years.


Butttt that's not what the million dollars is for.
deletedabout 7 years
I didn't say an efficient algorithm exists. I said the problem can be solved, given 1000 years.
AdrenalineMime
about 7 years
Tatami Save Us
deletedabout 7 years
Actually I'm right, and Clayton Math agrees


Clayton Math says

however the task of generating such a list from scratch seems to be so hard as to be completely impractical


Believe it or not, impracticality and impossibility are not the same thing
shady12
about 7 years
bro. "certainly seem to be of this kind" -> referring to "questions exist whose answer can be quickly checked, but which require an impossibly long time to solve by any direct procedure."

Meaning that an efficient algorithm would not exist.
deletedabout 7 years
The link you gave me literally told me that I was right. Given time, the puzzle will be solved. Impossible you say? Idiot, I say.
Tartosis
about 7 years
Everything shady said is right and everything Recidivism said is based on a misunderstanding.
shady12
about 7 years
*insert generic quote that does not prove your point*

So basically, you're wrong and dumb and I'm right and smart.
deletedabout 7 years
Let me help you.


Clayton Math says

Problems like the one listed above certainly seem to be of this kind



Clayton Math says

above certainly seem to be of this kind



Clayton Math says

certainly seem to be of this kind



Clayton Math says

certainly seem to be



Clayton Math says

certainly seem



Clayton Math says

certainly

deletedabout 7 years

shady12 says


Recidivism says

So you are posed with a challenge from a mathematical institute offering a million dollars to whomever finds a solution, which clearly they think is possible, and instead of spending your effort finding a solution you spend that effort trying to prove that it isn't possible.


Nice, that's how millions are made for sure. You go dude, you're going places.


Are you trolling at this point or do you still not understand? Proving it's possible or proving it's impossible are both worth a million dollars.


",,, In fact, one of the outstanding problems in computer science is determining whether questions exist whose answer can be quickly checked, but which require an impossibly long time to solve by any direct procedure. Problems like the one listed above certainly seem to be of this kind, but so far no one has managed to prove that any of them really are so hard as they appear, i.e., that there really is no feasible way to generate an answer with the help of a computer..."

https://www.claymath.org/millennium-problems/p-vs-np-problem

So basically, if you think it's impossible, you're an idiot.
shady12
about 7 years

Recidivism says

So you are posed with a challenge from a mathematical institute offering a million dollars to whomever finds a solution, which clearly they think is possible, and instead of spending your effort finding a solution you spend that effort trying to prove that it isn't possible.


Nice, that's how millions are made for sure. You go dude, you're going places.


Are you trolling at this point or do you still not understand? Proving it's possible or proving it's impossible are both worth a million dollars.
AdrenalineMime
about 7 years
"is it racist?" is also NP-complete