I think you're neither. My understanding is based on practical applications. That is, as far as I understand it, you're right about P and NP. From a practical p

I think you're neither. My understanding is based on practical applications. That is, as far as I understand it, you're right about P and NP. From a practical point of view, the optimization of the problem depends on knowing what the smallest K is that has a "Yes" answer. So, yes, checking the solution is P. Finding the solution is NP. Optimizing for K is, therefore, intractable. Does that sound (at least somewhat) right?