3 ms·

Nothing. Given infinite memory, a NAND gate is Turing complete by itself and trivial to construct based on the OP examples.

• csmantle 1y ago
  Unfortunately the examples provided by OP only contain combinational circuits, which by def. have no memory.
  • cluckindan 1y ago
    Well, there are half and full adders, maybe a flip-flop would be feasible?
    • csmantle 1y ago
      If we can introduce delay in the circuit it would be trivial to build FFs from Boolean-complete gate sets, thus sequential elements with memory. But AFAIK CSS if() can't introduce delays.
      • cluckindan 1y ago
        Keyframe animation?