The halting problem means no algorithm can decide whether another will terminate, making perfect global repetition a sign of failure

Turing’s halting problem proves no general procedure can determine whether an arbitrary computation will finish or loop forever. For algorithmic music this has a structural implication: infinite loops are not mere annoyances — they are formally analogous to contradiction in logic (‘an endless and timeless loop, monstrous because of its unlimited potential of infecting every part of the given system’). Rohrhuber observes a paradox: repetition is the most fundamental operation of computation, yet reaching a state of perfect global repetition is a sign of system failure. A live coder’s encounter with an infinite loop in performance thus has a formal-philosophical resonance beyond technical inconvenience.

Examples

A SuperCollider Routine that never .stop because its condition is never met — the canonical infinite loop. A TidalCycles pattern that cycles forever is not a ‘failure loop’ because it is externally clocked and intentionally non-terminating.

Assessment

Explain in your own words why global perfect repetition in a computation is considered a failure state according to Rohrhuber. Then describe a live coding scenario where an unintended infinite loop would be audibly different from an intentional repeating pattern.