this post was submitted on 27 Jan 2024
434 points (98.0% liked)
Memes
45665 readers
879 users here now
Rules:
- Be civil and nice.
- Try not to excessively repost, as a rule of thumb, wait at least 2 months to do it if you have to.
founded 5 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
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.
Or even in Minecraft using water pumps/valves
https://youtu.be/a1JsjYLn1Vo?si=FwaHXzSSuBCHNjyH
Here is an alternative Piped link(s):
https://piped.video/a1JsjYLn1Vo?si=FwaHXzSSuBCHNjyH
Piped is a privacy-respecting open-source alternative frontend to YouTube.
I'm open-source; check me out at GitHub.
In short, everything that is Turing-conplete can compute anything.
Except for that which is non-computable.
That doesn't compute.
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.