you are viewing a single comment's thread
view the rest of the comments
[–] 5 points 4 weeks ago (1 child)

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.

  • source
  • parent
  • hideshow 1 child comment
  • [–] 3 points 4 weeks 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.

  • source
  • parent