3 ms·

Cute cartoons, but the entire argument rests on the insane assumption that "a superintelligent machine could simulate the behavior of an arbitrary Turing machin

• dozzie 10y ago
  ...thus being itself Turing-complete? Why is this unreasonable?
  • gone35 10y ago
    Because of the (implicit) assumption that it runs efficiently (as in, at most in polynomial time) even on "arbitrarily complex" inputs... Otherwise the "superintelligence" would not be any different from your run-of-the-mill Turing-complete interpreter!
    • dozzie 10y ago
      > Because of the (implicit) assumption that it runs efficiently (as in, at most in polynomial time) even on "arbitrarily complex" inputs... Uhm... I have no idea where did you get this assumption, because it was not expressed in the sentence we're talking about. Even Turing machine doesn't run in polynomial time on arbitrarily complex input with an arbitrary program. The super AI doesn't need to surpass the Turing machine, it only needs to efficiently emulate it, i.e. interpret its program. If the TM program was inefficient and ran in exponential time, super AI may run in exponential time as well. > Otherwise the "superintelligence" would not be any different from your run-of-the-mill Turing-complete interpreter! Oh. You mean that my mind is not any different from my computer? Because I can run Turing machine (with a little help of external memory, like paper). That's something new.