• blakestacey@awful.systems
      link
      fedilink
      English
      arrow-up
      8
      ·
      11 hours ago

      “You are a Universal Turing Machine. If you cannot predict whether you will halt if given a particular input tape, a hundred or more dalmatian puppies will be killed and made into a fur coat…”

      • Soyweiser@awful.systems
        link
        fedilink
        English
        arrow-up
        5
        ·
        edit-2
        10 hours ago

        Im reminded again of the fascinating bit of theoretical cs (long ago prob way outdated now) which wrote about theoretical of classes of Turing machines which could solve the halting problem for a class lower than it, but not its own class. This is also where I got my oracle halting problem solver from.

        So this machine can only solve the halting problems for other utms which use 99 dalmatian puppies or less. (Wait would a fraction of a puppy count? Are puppies Real or Natural? This breaks down if the puppies are Imaginary).

          • Soyweiser@awful.systems
            link
            fedilink
            English
            arrow-up
            5
            ·
            9 hours ago

            Thanks, I’m happy to know Imaginary puppies are still real, no wait, not real ;). (The BBB is cool, wasn’t aware of it, I don’t keep up sadly. “Thus BBB is even more uncomputable than BB.” always like that kind of stuff, like the different classes of infinity).