Explain the concept of a Turing machine as a formal model of computation, including its components and operation. Discuss the Church-Turing thesis and its significance in defining computability. Provide examples of problems that are decidable versus undecidable, and explain why the halting problem is undecidable. Finally, discuss how the theory of computability relates to modern computing and whether quantum computing challenges the Church-Turing thesis.