Question: are np complete problems decidable?
Answer: If one is able to write any algorithm that does the job, the problem will be decidable. Thus all problems that belong to NP are decidable. But NP hard does not imply decidable always. In principle, all problems in NP can be reduced to Halting Problem which can be classified as both NP-hard and undecidable.