Yes it does answer your question. 1. Anything that can be solved in any one Turing-complete language can be solved in any other Turing-complete language. 2. B

Yes it does answer your question. 1. Anything that can be solved in any one Turing-complete language can be solved in any other Turing-complete language. 2. Both of these are Turing-complete languages, so obviously anything that can be solved in one can be solved in the other. 3. Lots of domain-specific languages are also Turing-complete, so anything that can be solved in C++ or Objective-S can be solved in them and vice versa. 4. It thus follows that (a) "can be solved" vs. "cannot be solved" is not a useful criterion for distinguishing between Turing-complete languages. Or that (b) there are no relevant differences between Turing-complete languages. 5. My money is on 4a.