This is an archived, read-only copy of the United-TI subforum , including posts and topic from May 2003 to April 2012. If you would like to discuss any of the topics in this forum, you can visit Cemetech's Your Projects subforum. Some of these topics may also be directly-linked to active Cemetech topics. If you are a Cemetech member with a linked United-TI account, you can link United-TI topics here with your current Cemetech topics.
So I made a 1D cellular automata program (in assembly) that could be pretty fun to play with It is about a hundred bytes and is pretty easy to use (you have an input in Ans that is the ruleset and the top row of pixels is the starting position).
Some things I might add:
Have the "world" stitched on the left and right
I am also putting thought into making a 2D cellular automata program, but since 2D has 2256 different rulesets and 26144 starting boards (on the calculator). If I do this, then that means folks will be able to apply programming theory because 2D cellular automata is Turing complete (meaning you could simulate any other Turing machine with enough time and memory [like a computer]).
Have your own thoughts to add to this or any other topic? Want to ask a question, offer a suggestion, share your own programs and projects, upload a file to the file archives, get help with calculator and computer programming, or simply chat with like-minded coders and tech and calculator enthusiasts via the site-wide AJAX SAX widget? Registration for a free Cemetech account only takes a minute.