Provide a rigorous definition of a Turing-complete system. Identify and analyze three distinct computational systems or programming languages, explaining why each qualifies as Turing-complete. Discuss the theoretical boundaries imposed by the Halting Problem within these systems.