For some reason, ternary [wikipedia.org] didn't take off, but on the other hand, it was proven by Shannon that any Turing machine can be reduced to a binary Turing machine, and most computer scientists agree that Turing’s, or any other logically equivalent, formal notion captures all computable problems, viz. for any computable problem, there is a Turing machine which computes it. ( https://plato.stanford.edu/entries/turing-machine/ [stanford.edu] ). The original Turing machine used more than just binary. What this means is that you are free to use whichever number-base suits your fancy, but it can always be reduce to a binary Turing machine.
(Score: 2, Touché) by Anonymous Coward on Thursday March 24 2022, @12:27PM (1 child)
You are still supporting the oppressive patriarchy by running your code on a processor that only supports binary representation
(Score: 3, Interesting) by pTamok on Tuesday March 29 2022, @11:18AM
For some reason, ternary [wikipedia.org] didn't take off, but on the other hand, it was proven by Shannon that any Turing machine can be reduced to a binary Turing machine, and most computer scientists agree that Turing’s, or any other logically equivalent, formal notion captures all computable problems, viz. for any computable problem, there is a Turing machine which computes it. ( https://plato.stanford.edu/entries/turing-machine/ [stanford.edu] ). The original Turing machine used more than just binary.
What this means is that you are free to use whichever number-base suits your fancy, but it can always be reduce to a binary Turing machine.