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.
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.
In short, everything that is Turing-conplete can compute anything.
Except for that which is non-computable.
Like yo Mama’s weight!
SCNR
New to me that there is proof that something is not computable.
The most obvious answer to this is the halting problem.
That doesn’t compute.
Or even in Minecraft using water pumps/valves
https://youtu.be/a1JsjYLn1Vo?si=FwaHXzSSuBCHNjyH