For challenges like Kolakoski or Shotgun numbers... would it be possible to have a function which iterates on an infinite list, assumes that the list converges from the beginning at some rate (possibly provided by another function) and then returns the fully converged infinite list?
For example, for Kolakoski, I could start initialise the list to 1,2,1,2,1,2,1,2,1,... and the define an iteration as "use this sequence to run-length expand 1,2,1,2,1,2,1.... The result will be wrong, but if I do it again, the result will converge towards the correct Kolakoski sequence and I know it will do so at a rate of at least one value per iteration.
