Accessibility Relation Sample Clauses

Accessibility Relation. ∆ : A×Σ×Σ → {R ∞} is the accessibility relation for PASes. ∆(α, σj, σk) describes the (possibly infinite) cost for some agent αi to move from σi to σj. ∆(·) models the structure of the possible agreement space Σ from the perspective of each agent. An agent with more limited capabilities might have a higher cost for changing from one PAS to another, or one PAS might be inherently more difficult (or impossible) to reach directly. For example, representing languages as binary strings and assuming only single point mutations as transition operators [▇▇▇▇▇▇ and ▇▇▇▇▇, 2004] results in a hypercube-structured ∆(·) for the language space.