On Tue, Nov 2, 2010 at 5:15 PM, Hypercube wrote:
> Some examples of CA usage:
>
> -cryptography, http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=338094
> -pseudo-random number generators,
> http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=31545
> -modelling of certain chemical reac
On 2 November 2010 12:49, Jason Grout wrote:
> On 11/2/10 6:07 AM, David Kirkby wrote:
>>
>> If Sage is ever to become a viable alternative to Mathematica, then it
>> really needs the features of that program.
>
>
> I think early on, there was a distinction made between focusing on having
> parity
On 2 November 2010 02:17, rjf wrote:
> Cellular automata of the sort that Wolfram talks about can be
> implemented
> in languages other than Mathematica much more efficiently. Maybe
> 10,000
> times faster when I wrote some stuff in lisp. Not for doing anything
> useful,
> just a speed competiti
On Mon, Nov 1, 2010 at 3:55 PM, David Kirkby wrote:
> On 1 November 2010 22:21, Hypercube wrote:
>
>> Cellular automata have proved to be a useful tool for modelling
>> discrete systems in various applications, so I think it could be
>> useful to a wide scope of researchers. At least "A New Kind
On 1 November 2010 22:21, Hypercube wrote:
> Cellular automata have proved to be a useful tool for modelling
> discrete systems in various applications, so I think it could be
> useful to a wide scope of researchers. At least "A New Kind of
> Science" seems to have brought it out of its niche, pa
On 1 November 2010 21:53, Hypercube wrote:
> Thank you. I will definitely try to build upon that source. However,
> it seems to be outdated; it gives tracebacks when run.
>
> What I meant was, what is necessary for it to be implemented into the
> main Sage distribution, once it is written? Or is i
