You are viewing a single thread.
View all comments
53 points
*

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.

permalink
report
reply
32 points

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

permalink
report
parent
reply
14 points
*

Except for that which is non-computable.

permalink
report
parent
reply
18 points

Like yo Mama’s weight!

SCNR

permalink
report
parent
reply
5 points

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

permalink
report
parent
reply
2 points

That doesn’t compute.

permalink
report
parent
reply
1 point

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

permalink
report
parent
reply
1 point

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.

permalink
report
parent
reply

Memes

!memes@lemmy.ml

Create post

Rules:

  1. Be civil and nice.
  2. Try not to excessively repost, as a rule of thumb, wait at least 2 months to do it if you have to.

Community stats

  • 11K

    Monthly active users

  • 13K

    Posts

  • 288K

    Comments