in reply to
Challenge: Sorting Sums Of Sorted Series

Can't help, have to ask this question:

how would an algorithm that would deal with this problem for infinite (huge...) lists look like...?

Update: And, given a finite part of each serie, a_{1}, ..., a_{N}, b_{1}, ..., b_{M}, how many - which - terms of the result could be trustfully computed (knowing that there are other terms to follow) ?

And how far could we advance with the 'arrival' of a_{N+1} and/or b_{M+1}...?

hmmmm... Is someone aware of some good readings in order to get the answers ?

Thanks,