Scratch - Decimal to Binary: cellular automaton approach
In this project, a decimal number is converted into a binary number creating a binary counter following a non-recursive cellular automaton approach with the following rules of evolution:
The state of the second cell (least significant bit) of the automaton (binary number) changes every new generation (decimal number).
The state of the other cells (bits) only change if the state of all the cells (bits) above are equal to 1.
When the state of the bottom cell (most significant bit) changes from 1 to 0, a new cell (bit) with a state of 1 is created below.
The input "enable" is actually the first cell of the automaton, enabling (disabling) its evolution when the state of this cell is 1 (0).
Link to the Scratch project:
https://scratch.mit.edu/projects/3925...