note
Krambambuli
Can't help, have to ask this question:<br><br>
how would an algorithm that would deal with this problem for infinite (huge...) lists look like...?<br><br>
Update: And, given a finite part of each serie, a<sub>1</sub>, ..., a<sub>N</sub>, b<sub>1</sub>, ..., b<sub>M</sub>, how many - which - terms of the result could be trustfully computed (knowing that there are other terms to follow) ?<br><br>
And how far could we advance with the 'arrival' of a<sub>N+1</sub> and/or b<sub>M+1</sub>...?<br><br>
hmmmm... Is someone aware of some good readings in order to get the answers ?<br><br>
Thanks,
<!-- Node text goes above. Div tags should contain sig only -->
<div class="pmsig"><div class="pmsig-600591">
<br>Krambambuli<br>
---<br>
</div></div>
820975
820975