ecaxpr
| Crates.io | ecaxpr |
| lib.rs | ecaxpr |
| version | 0.1.1 |
| created_at | 2025-10-03 17:50:35.658551+00 |
| updated_at | 2025-10-04 05:41:45.765241+00 |
| description | Tiny expressions-based language for elementary cellular automata simulation |
| homepage | |
| repository | https://tangled.org/@did:plc:h5uflu6cfdbvjsggusevvy6i/ecaxpr |
| max_upload_size | |
| id | 1867028 |
| size | 19,413 |
EcSolticia (EcSolticia)
documentation
README
ecaxpr
ecaxpr is a tiny, declarative, expressions and predicate logic-based language for elementary cellular automata simulation.
There are a total of only 256 distinct elementary cellular automata. We can refer to each of them via a number from 0 to 255 by representing their state evaluation tables as bits. However, ecaxpr represents their rules not by just a simple number, but as a logical formulae. This provides a distinct way of experimenting with and thinking about these cellular automata.
Here, an expression such as
l == ~(r | t)
***************#*************** 15
becomes...
***************#***************
**************###**************
*************##**#*************
************##*####************
***********##**#***#***********
**********##*####*###**********
*********##**#****#**#*********
********##*####**######********
*******##**#***###*****#*******
******##*####*##**#***###******
*****##**#****#*####*##**#*****
****##*####**##*#****#*####****
***##**#***###**##**##*#***#***
**##*####*##**###*###**##*###**
*##**#****#*###***#**###**#**#*
##*####**##*#**#*#####**#######
Install, Get Started, Get Docs
For installation instructions, documentation and a guide, you may refer to different sections of The ecaxpr Book.