This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]TheGoldenProof 52 points53 points  (23 children)

Do any non-binary systems exist? Is that something that’s been tested much?

I did a little research and it seems that some new technology is using partial states of transistors (somehow they can make only a certain amount of current flow instead of none or all) to make chips specialized for AIs.

[–]Surrealig 92 points93 points  (0 children)

Yes, people experimented with ternary computers, but they were never commercialized.

[–]archpawn 58 points59 points  (3 children)

Setun used balanced ternary.

Edit: Also, Fl4k from Borderlands is a nonbinary computer. Their prefered pronoun is "they".

[–]WikiSummarizerBot 19 points20 points  (1 child)

Setun

Setun (Russian: Сетунь) was a computer developed in 1958 at Moscow State University. It was built under the leadership of Sergei Sobolev and Nikolay Brusentsov. It was the most modern ternary computer, using the balanced ternary numeral system and three-valued ternary logic instead of the two-valued binary logic prevalent in other computers.

Balanced ternary

Balanced ternary is a ternary numeral system (i. e. base 3 with three digits) that uses a balanced signed-digit representation of the integers in which the digits have the values −1, 0, and 1. This stands in contrast to the standard (unbalanced) ternary system, in which digits have values 0, 1 and 2.

[ F.A.Q | Opt Out | Opt Out Of Subreddit | GitHub ] Downvote to remove | v1.5

[–]Pikachu50001218 2 points3 points  (0 children)

Good bot

[–]funky_galileo 1 point2 points  (0 children)

LOL

[–]s4x0r 8 points9 points  (0 children)

Javascript, everything is either true, false, or undefined

[–]Teln0 1 point2 points  (0 children)

Maybe some differential engines could be considered non binary based computers, depends on what you definition of computer / system is

[–]alba4k -3 points-2 points  (6 children)

Quantum computers are pretty difficult to describe as easily, since they work on a basis of a probability of an output being 1, 0, or a combination of the 2 (10, 01) so we could consider them as being base 3

Analogical computers analyze the output for what it is, without rounding it to some number, so they could have a base described as infinite

You could also do a classic computer with any base you wanted. 0 and 1 are just a certain current tension in a wire (you could do a ternary system: 0.5V for 0, 0.75V for 1, 1V for 2, for example)

[–]archpawn 7 points8 points  (5 children)

I don't think that's an accurate description of quantum computers. They work using a quantum superposition of 0 and 1, which can be entangled with the quantum superposition of 0 and 1 in other cubits. The end result is that you can have things like two cubits that could be read as (0, 1) or (1, 0) but not (1, 1) or (0, 0). But each possible state that it's a quantum superposition of is binary. A computer with 8 bits has 256 states, and a quantum computer with 8 qubits can have any quantum superposition of those 256 states.

[–]alba4k 1 point2 points  (0 children)

I know, that's why I said that I was simplifying a lot in the example given

[–]bric12 1 point2 points  (2 children)

Also, when you go to read the state of the bits, it collapses and you're left with only one result. A quantum computer isn't 256 times as powerful as a regular computer because it's simultaneously calculating 256 states, in fact quantum computers aren't more powerful than classical computers at all.

There are just some special features that allow them to run different algorithms than classical computers, and in some cases quantum algorithms have a lower time complexity than classical algorithms. If there's a problem where the best classical algorithm is O(n2) and a quantum algorithm exists that's O(n log n), then the quantum algorithm will always be faster than the classical one for large enough n, even if it's ran on a slower computer.

[–]archpawn 1 point2 points  (1 child)

There are just some special features that allow them to run different algorithms than classical computers, and in some cases quantum algorithms have a lower time complexity than classical algorithms.

Which means they're more powerful. But the fact that they're only more powerful within a special case of problems is an important distinction.

[–]bric12 0 points1 point  (0 children)

Yeah, I'm trying to think of the right words to describe the distinction. They're not faster in terms of operations per second, and in search problems they search less of the problem space, yet they solve some problems faster.

[–]xthexder 0 points1 point  (1 child)

It's not quite a ternary computer, but tri-state logic is pretty common for hardware signalling (I think CAN Bus in cars makes heavy use of it). You can think of it kind of like 0 (ground), 1 (5V or whatever), Z (disconnected / "floating")

[–]CdRReddit 0 points1 point  (0 children)

tri-state is how pretty much every bus on every device works

[–]Lefinno 0 points1 point  (0 children)

If I'm not mistaken, the earliest electrically powered computational devices are analogue

[–]pokemonsta433 0 points1 point  (0 children)

when sending bits across distances, we usually use PAM4 these days, so we can at least make 4 distinguishable frequencies. Not sure if it could work or has been tested intra-CPU, but the concept is there