Unpublished work, an artificial chemistry. The short molecules at the top are being replicated by proximity to the 21 enzymes below. Each enzyme catalyses one of the reactions needed.
Previous papers showed that it is possible to wrap this whole assembly into a cell that can copy itself and compete for resources with others.
The challenge now is to find a way to simulate this kind of system fast enough that we can watch it evolve.
Margolus neighborhood can be extrapolated to more colors, more block size, and more or less dimensions. For example, on first picture this is how 1D invertible automata with block size 2 looks like. Time goes from top to bottom. For 1D 2-block-size automata you get \(2^2!=24\) possible rules.
For it I found that there exists 4 rule transformations that joins similiar rules together. Second picture shows 4 different groups of rules. (source: https://optozorax.github.io/p/invertible-1d-automata/)
RCA is interesting, because quantum mechanics is reversible too (source: wikipedia), and RCA is closer to our physics than non-reversible ones. This is why losing information in black holes seems like a big problem.
And you can simulate RCA backwards in time! It means that you can get previous states for any of your bit images. Gif shows how random state evolves to the text "hi" in invertible rule called Critters.
Simulator link: https://dmishin.github.io/js-revca (check out help page, it's nice)
You can get RCA by constructing it using special methods:
• Margolus neighborhood: replace each 2x2 block according to the rules, then offset a grid diagonaly by 1 block and do the same (first picture)
• Partitioned neighborhood: replace inner block of points according to rules using outer points (second picture) (DOI 10.1007/s11047-017-9655-9)
• Second-order CA (see wikipedia on RCA)
Thread about Reversible Cellular Automata! #reversible_ca
RCA is CA that has exactly one previous and exactly one next state. For example, Conway's Game Of Life is not reversible, because you can have multiple states converge to emptiness. And GoL can have [0; inf) previous states, and exactly one next. Thus, non-reversible CA constantly lose information.
The GIF shows glider in a RCA called "Single rotate", it uses Margolus neighorhood with block of size 2. (Source http://dmishin.blogspot.com/2013/11/the-single-rotation-rule-remarkably.html)
• Name - 𝙸𝚕𝚢𝚊
• Speak Russian and English
• Work as a C++ programmer
• 23 y.o.
• Computer graphics
• Portals geometry, 4D, hyperbolic geometry
• Ergonomic keyboards
• Cellular automata, especially invertible ones
• Simulation of evolution, artificial life
• Rust programming language
• Geometric algebra
I have some content on some of these topics, and I will try to post it here.
The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!