It is amazing that the computation of the whole sequence of 5000 items takes almost the same time as the most complicated of the items. (6!:2)' ((0 3+*&5)^:5000)1 0x' 0.503731 (6!:2)' ((0 3+*&5)^:(>:i.5000))1 0x' 0.611015
Boyko wrote: "that finding a wrong answer to a problem can be cheaper than finding the correct one which you have been doing recently, although you pretend to be finding a correct answer". I don't know which wrong answer he is referring to. - Bo >________________________________ > Fra: Boyko Bantchev <boyk...@gmail.com> >Til: programm...@jsoftware.com >Sendt: 12:32 fredag den 28. december 2012 >Emne: Re: [Jprogramming] arithmetic sequence > >On 28 December 2012 01:41, Bo Jacoby <bojac...@yahoo.dk> wrote: >> To me it is not clear what the exact domain is. > >Then read the original post at >http://jsoftware.com/pipermail/programming/2012-December/030601.html >which states the problem clear enough to me and, by all evidence, >to everybody else in this thread but you. > >> The problem was to solve the recursion S(n+1)=3+5*S(n), S(0)=K. > >You must be joking. This was not the problem. > >Now, please don't waste your, and others', time to prove trivial, >exceptionally boring things, such as that a single member of a >sequence can be computed faster than computing the whole sequence >(like you did before), or that finding a wrong answer to a problem >can be cheaper than finding the correct one (which you have been >doing recently, although you pretend to be finding a correct answer). >Such exercises are useless. They are especially futile as a means >to attack my claims, as you attempted. >---------------------------------------------------------------------- >For information about J forums see http://www.jsoftware.com/forums.htm > > > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
