the Discord thread wrote:
NNlk05 started a thread: The AROSICA project: A Real OS In CA
NNlk05: *A copy of the first post of this thread here*
NNlk05: see the forums thread (links to the thread)
speedydelete: for maximizing recursive runner speed i would use a sticky-style rule
NNlk05: thats fine ig
speedydelete:
that minimizes the need to cause CA runs
wait
you get how it works?
the recursive runner
it verifies components and builds up the tree
and the bb checks garuntee that it matches the CA
NNlk05: garuntee
speedydelete: (Replying to last message)
yes
it will always be correct
NNlk05: anyways the bliptile metacell will be really easy
speedydelete:
no
do not metacell
NNlk05: no shi[CENSORED]?
speedydelete:
actually
never mind
but i would just add more states to sticky
more behaviors
for whatever you want
speedydelete: (Replying to "never mind") i just realized there's a way to make metacells fast
NNlk05: sticky is hard
speedydelete: but it will still be faster to not emulate
NNlk05: itll be slower to build tho
speedydelete:
can't you just plug in bliptile
as an @TABLE
NNlk05:
After all, I would definitely want this machine to be in the most iconic CA of them all.
-- Disaster16439
lets just do it in bliptile first
speedydelete: what even is bliptile
*messages explaining Bliptile and how simple it is*
speedydelete:
ok
yeah this will be fine with the recursive runner
if you unsheath it
and also it must be very modular and incremental WITHOUT EMULATION
NNlk05:
wydm
so only one layer?
speedydelete: no emulating other CAs like QFT
NNlk05: wait whts that
speedydelete:
quest for tetris
modularizing it will make it faster
make a memory cell module and then combine them without overlapping BBs
or an adder module from logic gate modules
that will be very fast
as long as you don't overlap BBs
NNlk05: in he unsethed version right
speedydelete: (Replying to last message)
yeah
(i might end up making it so it uses bounding octagon instead of BB so then you can pack em together a bit tighter but its also slower that way idk)
well i guess it's coda so it's not that hard to allow both
but yeah no bb overlapping is key for max performance
NNlk05: *sets a reminder in one hour for doing the ruletable*
speedydelete: (if coda compiler never happens then i'll write it in C)
*talk about sleep*
speedydelete:
also please feel free to crosspost my notes above (with credit ofc)
or you may ask me to do it but you will have to wait like 12 hours
NNlk05: @speedydelete
Code: Select all
#R Blipspace-2026-09-06
!
@RULE Blipspace-2026-09-06
Blipspace version @ 2026-09-06
Bliptile within empty space
By NNlk05
Made for the AROSICA project
@TABLE
n_states:4
neighborhood:Moore
symmetries:rotate4reflect
var a = {0, 1, 2, 3} # Any
var a1 = a
var a2 = a
var a3 = a
var a4 = a
var a5 = a
var a6 = a
var a7 = a
var a8 = a
var b1 = {0, 1, 2} # Anything but tail
var b2 = b1
var b3 = b1
var b4 = b1
var b5 = b1
var b6 = b1
var b7 = b1
var b8 = b1
# C N,NE,E,SE,S,SW,W,NW C'
# Empty
0 2,b1,b2,b3,b4,b5,b6,b7 2 # Turn into head
0 a1,1,2,3,a2,a3,a4,a5 2 # Split
# Block
1 a1,a2,a3,a4,a5,a6,a7,a8 1 # Stay
# Head
2 a1,a2,a3,a4,a5,a6,a7,a8 3 # Turn into tail
# Catch all
a a1,a2,a3,a4,a5,a6,a7,a8 0
@NAME
0 Empty
1 Block
2 Head
3 Tail
@COLORS
0 0 0 0
1 255 64 64
2 64 64 255
3 64 64 64
*speedydelete trying to add the rule to Caterer*
speedydelete:
stupiddddd
sorry
oh i see how it works
very simple rule
@NNlk05 now add universal construction
you need it for memory circuits
or some way for stable memory
recursive runner LOVES stable memory
NNlk05: i kinda reused a old version of nnlk05-univ
*ends*
