Given a NP Algorithm for SAT, do we expect to have Correct and Incorrect Solutions?
Usually, when one develops an algorithm, there is a proof of correctness. From what I know, "nondeterministic" means the algorithm may or may not give you the correct answer, but it will definitely not give you an incorrect one.