I know what you mean - I'm looking for similar things. I can help you with:

- Calculators: binary addition (the only operation I can do in TPT).
(If you're not interested in how it works, you can jump all this part.)
You need to combine some logic gates, so that: 1) if you spark only one of them, it will spark the cave corresponding to 1; 2) if you spark both of them, it will spark the cave corresponding to 10 and it will "delete" the spark to the cave 1.
To realize 1), just connect the first input to the cave 1, but put an (improperly called) NOT gate (NSCN - space - PTCT - space - NSCN) on the path. Do the same on the second input.
To realize 2), make an AND gate (Input 1--->PSCN - space - NTCT - space - Input 2---->METL, and a PSCN wire perpendicularly meeting the NTCT point. There must be a pixel of distance between the wire and the NTCT.) between the two inputs: link it to the 10 wire. To delete the spark, just link a METL wire to the CNOT gate: it must be perpendicular to the CNOT gate, and meet in the PTCT pixel. 1 pixel of distance between METL and PTCT.

Each input on the nth addition gate corresponds to the instruction "add 1 unit of the order n": so "add 1", "add 10", "add 100" and so on.

Visual counter
It's hard to explain in words, just see yourself.


It's not very much, but I hope it helps. Oh, and I'm looking for some parts too.

I can help out if you would like I can say via conversation binary addition is only experimental for me but simple memory and logic along with hardwired compilers and graphics cards are my specialities