Does a Non-Deterministic Turing Machine solve all problems in P in constant time?
A nondeterministic Turing machine can guess at most one bit each step &mdash; this is how they are defined. In particular, a nondeterministic Turing machine running in constant time can be converted to a deterministic machine also running in constant time. This should allow you to answer your own question.