Tags
finite state machine, FSA, FSM, full adder, half adder, Python, state engine, state table, truth table
I was involved in a debate recently about whether a full adder logic circuit is a computer. The computer science answer is: “No, not as we define a computer.”
I plan to address that answer in detail on my main blog. Here I wanted to show some of the different ways a full adder can be modeled and implemented.
