Is the halting problem undecidable

Yes, the halting problem is undecidable, meaning that there is no algorithm that can determine whether a given program will halt or run indefinitely.