👉 Untransitoriness is a concept in computer science and mathematics that refers to the inability of a function or algorithm to be applied recursively to a given input without causing an infinite loop. It is often used to model situations where a recursive algorithm cannot terminate, even though it may perform well on small inputs. In other words, untransitoriness ensures that if a recursive algorithm produces a non-repeating sequence of output values (i.e., the function does not repeat its outputs), then there must be
