Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I don't agree with that. The pronoun "this" does not appear in the example question you just provided. There's a difference between "this" and "his" and the difference is how they resolve contextually.

And in the OP's question, it's obvious that "this" resolves to the current question that it appears in. It seems like you want to say that this is not obviously the case simply because the question is unanswerable. Yet I'm not convinced that you didn't invent this requirement yourself. Anyone reading the OP's question would clearly understand to what the "this" is referring.



I've given clearer examples in updated answer here - https://math.stackexchange.com/a/3437700/725808

Basically, OP has not provided a base case for his recursive question. As a result, it goes on infinitely, ending up in stackoverflow.


>Because there are still unresolved pronouns in (Q2).

When something is self-referential and resolves to itself, that's the end of the recursive process. There's no need to produce a Q2 that is Q layered inside itself. You go and substitute the entire sentence in place of "this" and form some unresolveable chain of recursion but you do it for no apparent reason. If these were statements in a programming language your expansion might make sense, but not in the context of spoken english language.


I've updated the answer again with hopefully clearer examples.

You're getting stuck because you're used to only 1-level resolution/replacements for pronouns, because that's what we're used to in daily speak.

But I've given a concrete 2-level example, where you will question your own stance of "that's the end of the recursive process", and help you expand the logic to 3-levels deep, 4-levels, 5... to infinity.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: