Loops have existed in programming since Bohm and Jacopini's 1966 theorem, which established that three constructs—sequence, conditionals, and loops—are necessary and sufficient for Turing completeness; agents now employ loops to achieve this computational universality.