Are there decidable problems that are reducible to undecidable problems?
Any decidable problem can be reduced to the halting problem. Take a machine&nbsp;$M$ that decides some language&nbsp;$L$. Now produce a new Turing machine&nbsp;$M'$ that behaves identically to&nbsp;$M$ except that, if $M$&nbsp;rejects, $M'$&nbsp;loops forever. Now, $M'$&nbsp;halts on input&nbsp;$x$ if, and only if, $x\in L$.

More generally, every decidable problem can be reduced to every undecidable problem. Let $Z$ be some undecidable language.  We know that $Z\neq\emptyset$ and $Z\neq\Sigma^*$, since both of those languages are trivially decidable. Therefore, there are strings $z^+\in Z$ and $z^-\notin Z$.  Now take any decidable language&nbsp;$L$.  Since $L$&nbsp;is decidable, the function
$$ f(x) = \begin{cases}z^+&amp;\text{if }x\in L\\z^-&amp;\text{if }x\notin L\end{cases}$$
is computable, and it is a reduction from $L$ to&nbsp;$Z$.


  I am thinking a decidable problem could be reduced to a recognizable, undecidable problem because a polynomial time verifier would work on a decidable problem. Is this a correct idea?


I think you're confusing the set of recognizable languages with NP. A recognizable language has a computable verifier but the verifier doesn't necessarily run in polynomial time (and the time hierarchy theorem says that there are languages whose verifiers can't run in polynomial time). It's true that every decidable problem has a computable verifier (because being able to decide the problem essentially means that you can verify a given answer by just computing the correct answer and comparing) but that doesn't give you a reduction. Rather, it proves that every decidable language is itself recognizable.