An algorithm is defined as a well$-$ordered collection of unambiguous and effectively computable operations that, when executed, produces a result and halts in a finite amount of time. In one sentence or less, what circumstances would cause a program to not halt in a finite amount of time?