DNA Computing Algorithm to solve the Hamiltonian problem
Yes, of course.  The Hamiltonian path problem is decidable, so it can be solved using a Turing machine.

I recommend you read about the Church-Turing hypothesis, decidability, and undecidability.  I think you'll find those topics of interest.