On Fri, 28 Nov 2008, Viktor Cerovski wrote:
> But the truth is that the Graham's accumulator-generator problem can
> be solved without any resort to lexical closures. One such solution,
> based on the Burke's solution from the link above but without
> cocreate is:
>
> G =: 1 : 0
> n=.'n',":?10000000000x
> (n)=:m
> 3 : (n,'=:',n,'+y')
> )
This is not a good example, it use base locale or the current locale
when G is called. Value of n can be changed apart from by G, and G
will fail. Whether it is called lexical closure or cocreate or
otherwise, some physical location of ram/harddisk/paper/neuron is used
to store its state.
If there is a difference between non-deterministic and random, I would
say random has to satisfy certain statistical properties to be
qualified as random. On the other hand non-deterministic means
undefined so that I can use any algorithm but just don't tell you.
--
regards,
====================================================
GPG key 1024D/4434BAB3 2008-08-24
gpg --keyserver subkeys.pgp.net --recv-keys 4434BAB3
唐詩096 宋之問 題大庾嶺北驛
陽月南飛雁 傳聞至此回 我行殊未已 何日復歸來
江靜潮初落 林昏瘴不開 明朝望鄉處 應見隴頭梅
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
