Suitcase lock

Question

I think there is no polynomial algorithm for opening a code lock with n sets on a suitcase. However, to verify that the existing solution is easy, it is only to open the suitcase. So, the problem is NP, but not P.

Obviously, I'm wrong. Where am I mistaken?

Answer 1

Start from the end - you didn't just prove P! = NP in a two-line question.

The problem is that the problem with the suitcase is not defined. Turing machines cannot open suitcases, you need to somehow model the suitcase.

, , , .

, @indiv, , . :

def figure_suitcase_code(code):
    return code

- .

Answer 2

zmbd.

. ; , , . , : .

, Computer Science "". - , "/". , , . :

A, , NP ^ A, P ^ A. , P!= NP?

: , A, P ^ A!= NP ^ A, B, P ^ B == NP ^ B. , NP , P oracle, , P!= NP.

:

. . , . . , " P =? NP"