No! Bad boy! Very bad boy! Sit!
But can it run Crysis?
On modern CPUs? Almost.
Breaking: turing-complete system can simulate any turing machine
Here is an alternative Piped link(s):
Piped is a privacy-respecting open-source alternative frontend to YouTube.
I’m open-source; check me out at GitHub.
How had I never seen this? This is brilliant!
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.
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
In short, everything that is Turing-conplete can compute anything.
Except for that which is non-computable.
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.
Like yo Mama’s weight!
SCNR
