• mindbleach@sh.itjust.works
    link
    fedilink
    arrow-up
    5
    ·
    7 days ago

    Every machine is a plain old Turing machine.

    Even quantum computing is just a shortcut for a subset of hideous obscure proofs. They aren’t doing different math. Special pleading is a fallacy… except when I do it, that’s different.

    • AppleTea@lemmy.zip
      link
      fedilink
      arrow-up
      3
      ·
      7 days ago

      I don’t quite think my lawnmower is boolean complete.

      And while quantum computing may be expressible algorithmically (dunno, your claim, not mine), that doesn’t mean all of quantum physics is.