The copy-cat strategy is a dynamic version of the tautology A∨¬A

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• Copy-cat strategyconcept0.854
  Game-theoretic strategy reflecting pure interaction; basis for understanding universal computation through interaction in Geometry of Interaction.
• quote_copycat_tautologyquote0.774
  Verbatim: 'the copy-cat strategy can be seen as a dynamic version of the tautology A ∨¬A.'
• Copy-cat processes (partial involutions) are computationally universalfinding0.743
  Mere copying of tokens between paired positions suffices to simulate all partial recursive functions and model higher-order logics.
• Tautology of Reinforcement Learningconcept0.739
  The circular definition in RL where rewards reinforce behaviors that secure rewards, e.g., going to a cafe because coffee is rewarding.
• dynamic tautologyconcept0.734
  The idea that copy-cat strategies are dynamic counterparts to classical tautologies like A∨¬A.
• The elimination of reward as a motivator of behavior with prior beliefs dissolves the tautology of reinforcement learning (rewards reinforce behaviors that secure rewards).claim0.716
  §4 Discussion.
• whether many (maybe even all) useful organisations of information and behaviour in a dynamic language might be constructed from a single primitive operation: n-way associative lookupquestion0.715
  The central research question explored, by way of examples, throughout the paper.
• the diagram suggests a game strategy in which the rules of the device stimulate the modification of the game as it unfolds in favor of improvisation and noveltyquote0.709
  Veloso’s interpretation of the Fun Palace diagram as an open-game infrastructure that encourages emergent play.