Automatski already had a probabilistic computer years ago. It supported Boolean, Complex and Quaternion Algebras. Basically Automatski’s Probabilistic Computer can execute Probabilistic Computing over Universal Boolean Circuits exemplified in the example above. And now… The Reversible Computing Breakthrough All of these gates have been reversed. We don’t need to invent special reversible boolean logic gates.Continue reading “Breakthrough – Probabilistic Computer + Reversible Computing”