Entropy stops this algorithm

Here is a weird way to prove that an algorithm terminates quickly. Say the algorithm flips random coins and fixes things. Each fix might break something else, so it fixes that too and so on. Also assume there is no easy way to quantify progress, i.e. a potential-function kind of analysis doesn’t work or is cumbersome. We will show that if the algorithm ran for too long, then its execution could be…