BSM (practically TC FSM)

[Rudxain]

The implementation seems to have a maximum of 2^16 cells, therefore it's a Linear-Bounded Automaton, not a Turing Machine.

I think it's worth adding that to the README

[orca-pet3910YT]

the original had unsigned 2^16 cells btw

[Rudxain]

the original had unsigned 2^16 cells btw

wasn't it 30k? 😅

That aside, I made a mistake: It's not LBA, it's a BSM. That is, a practically-TC FSM

[orca-pet3910YT]

no, 65536 or 65k

[orca-pet3910YT]

update: some had 32k some had 65k and some allocated an RGB framebuffer for a snake game