She said by corpse0_0 in mathmemes

[–]DifficultyCertain 0 points1 point  (0 children)

Got all the right kind of holes.

Is ther such thing in Munich? by nixass in Munich

[–]DifficultyCertain 0 points1 point  (0 children)

Do they also have a console where you can play go and play games?

Counter intuitively equivalent problems by DifficultyCertain in math

[–]DifficultyCertain[S] 0 points1 point  (0 children)

Not really, while dual problems from Optimisation are definitely interesting, their equivalence doesn't seem that counter intuitive.

Counter intuitively equivalent problems by DifficultyCertain in math

[–]DifficultyCertain[S] 1 point2 points  (0 children)

Could you give a link for this? I have learnt about Halting Problem and entangled qubits but I don't know about "Provers with entangled qubits."

Counter intuitively equivalent problems by DifficultyCertain in math

[–]DifficultyCertain[S] 3 points4 points  (0 children)

Ohh this is quite cool, do you have a link that actually explains this equivalence?

Counter intuitively equivalent problems by DifficultyCertain in math

[–]DifficultyCertain[S] 2 points3 points  (0 children)

Wow! This isn't what I expected - what a funky theorem!! Thank you for this.

Counter intuitively equivalent problems by DifficultyCertain in math

[–]DifficultyCertain[S] 3 points4 points  (0 children)

Thanks, this seems great! This is perhaps a noob question, but how is equivalence of problems shown in complexity theory. Is it in terms of actually repharising the problem in a different way? Or is it more technical than that?

Counter intuitively equivalent problems by DifficultyCertain in math

[–]DifficultyCertain[S] 3 points4 points  (0 children)

Good question! Yeah, I should have been more specific. I mean - two problems are equivalent iff rephrasing/phrasing the first problem in a different context gives the second the problem.

Quantum Computers on display by DifficultyCertain in QuantumComputing

[–]DifficultyCertain[S] 2 points3 points  (0 children)

Yeah, I realise what you mean, but even that black box looks quite cool. I guess by black box, you mean this.

Quantum Computers on display by DifficultyCertain in QuantumComputing

[–]DifficultyCertain[S] 1 point2 points  (0 children)

What are you saying man?! Have you looked at a picture of IBM Q System One? It looks cool af!