question people
Is it possible that a decision problem can NOT be solved in polynomial time on one computer, but can be solved in polynomial time on a faster computer?
my answer is NO
because NP complete hard problems are problems of SPACE
though its length may not be computed in a given time
given an input K
for example K-colouring
through if the input is defined then it is polynomial
but the speed of the computer can not define whether it can be solved
is this correct?