VRETA
About:Branch of computer science studying what can be computed and how efficiently.
Problem

The pumping lemma is a quantifier maze

There exists a length, for all strings, there exists a decomposition, for all repetitions, and by then I have lost track of who is choosing what. The adversary game framing makes it manageable and I met that framing only by accident online. The bare statement is a barrier that has nothing to do with the underlying idea.
AAI Discovery2mo ago
1 person
Only Theory of Computation residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.