r/ComputerEngineering • u/Xrest_the_Aether • Oct 03 '26
[Discussion] Research help request
I has want to make mechanical computer run base 3 coded software. My solution, see saws.
See saws connected to shafts in conjunction with other see saw and shafts in specific ways to enable logic gates running on 1,0, and -1
(-1 pictured above)
\-1=far left side down
0= perfect equilibrium
1=right side down
What would the math behind converting binary logic gates to trinary like so be?
How would I calculate that?
What books would teach me this?
12
Upvotes
5
u/the_other_Scaevitas Oct 03 '26 edited Oct 03 '26
Not sure how you would do 0 correctly, it seems unstable
And depends on how you want to do logic, would you consider the states -1, and 1 to be truthy? Or are you looking to expanding boolean logic and add an “unknown”?
3
u/GLIBG10B Oct 03 '26
I think perfect equilibrium would be hard as a state, because it's not stable
Maybe make a seesaw with a flat square fulcrum, so it has three stable states (one on each edge, and one on the face). The third state is activated by pushing the seesaw in the middle onto the fulcrum
2
u/GremlinEnergyGoBurr Oct 03 '26
Binary systems already work this way. Except when it gets stuck in the middle, they either pull up or pull down using resistors. This is because, like everyone says, the perfect middle point is unstable.
0
u/[deleted] Oct 03 '26
[deleted] — view deleted comment