Welcome to Incremental Social! Learn more about this project here!
Check out lemmyverse to find more communities to join from here!

BeigeAgenda ,
@BeigeAgenda@lemmy.ca avatar

But can it run Crysis?

fkn ,

On modern CPUs? Almost.

zewu ,

Breaking: turing-complete system can simulate any turing machine

AnarchistArtificer ,
joelectron ,

How had I never seen this? This is brilliant!

TimeSquirrel ,
@TimeSquirrel@kbin.social avatar

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 ,

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

photonic_sorcerer ,
@photonic_sorcerer@lemmy.dbzer0.com avatar

Except for that which is non-computable.

ShortN0te ,

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

MacFearrs ,

The most obvious answer to this is the halting problem.

Norgur ,

Like yo Mama's weight!

SCNR

Brickhead92 ,

That doesn't compute.

EmiliaTheHero ,

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

Norgur ,

No! Bad boy! Very bad boy! Sit!

  • All
  • Subscribed
  • Moderated
  • Favorites
  • memes@lemmy.ml
  • random
  • incremental_games
  • meta
  • All magazines