# Halting Problem **Domain:** Computability Theory **Doc Type:** Problem **Maturity:** Developed **Related:** [[Alan Turing]], [[Undecidability]], [[Decision Problem]], [[wiki/Bauhaus Architects of AI|Bauhaus Architects of AI]] ## Definition The halting problem asks whether an algorithm can determine for every program and input whether execution eventually stops. ## Bauhaus Architects Context Turing proved that no general algorithm solves it. It is related to incompleteness through diagonal reasoning but is not the same theorem. ## Backlinks - [[wiki/Bauhaus Architects of AI|Bauhaus Architects of AI]] - [[articles/Bauhaus Architects of AI|Bauhaus Architects of AI]]