Well, author tries to prove it's not. And, btw, oracle is something more than just an external observer, it can be used, for example, to solve the halting problem in classes for which it would be impossible with nondeterministic machines.
In my hastly typing i forgot to add 'in' to valid.
Could you elaborate on the oracle approach? Because I interpreted it as being the external observer in this case. From computational complexity I know that an oracle solves NP problems in polytime by a nondetermnistic turing machine, but I am not sure how this oracle stuff loops back to the philosphical argument.
The proof provided by Aaronson is really opague as to what and how it proves that the argument is invalid.
GlobalTraveler|9 years ago
Could you elaborate on the oracle approach? Because I interpreted it as being the external observer in this case. From computational complexity I know that an oracle solves NP problems in polytime by a nondetermnistic turing machine, but I am not sure how this oracle stuff loops back to the philosphical argument.
The proof provided by Aaronson is really opague as to what and how it proves that the argument is invalid.