Registered: May 2011
Posts: 4

I'm interested in knowing the current fastest method for executing 1-dimensional cellular automata with two states and a neighborhood size of one on a PC.

I'd guess part of it depends on whether you're interested in keeping intermediate states or whether you're only interested in the final result after some number of steps.

I'd also guess that different rules might have different characteristics in terms of performance on a PC, but I'm particularly interested in class III rules.

Report this post to a moderator | IP: Logged