Theoretically, anything that can implement boolean logic can be used to build a Turing-complete CPU. It just needs to represent a "true" state", a "false" state, a way to make a comparisons, and an input and output mechanism to feed other subunits or retrieve data from them. Stuff like this has also been implemented using water pumps/valves, and even in Minecraft using redstone. Computers don't have to be based on electronics.

[–] ShortN0te@lemmy.ml 32 points 9 months ago (1 children)

In short, everything that is Turing-conplete can compute anything.

[–] photonic_sorcerer@lemmy.dbzer0.com 14 points 9 months ago* (last edited 9 months ago) (3 children)

Except for that which is non-computable.

[–] Norgur@kbin.social 18 points 9 months ago

Like yo Mama's weight!

SCNR

[–] ShortN0te@lemmy.ml 5 points 9 months ago (1 children)

New to me that there is proof that something is not computable.

[–] MacFearrs@lemmy.dbzer0.com 17 points 9 months ago

The most obvious answer to this is the halting problem.

[–] Brickhead92@lemmy.world 2 points 9 months ago

That doesn't compute.

[–] EmiliaTheHero@possumpat.io 1 points 9 months ago

Stuff like this has also been implemented using water pumps/valves, and even in Minecraft using redstone.

Or even in Minecraft using water pumps/valves

https://youtu.be/a1JsjYLn1Vo?si=FwaHXzSSuBCHNjyH