Partial involutions form a Linear Combinatory Algebra under function application defined by feedback loops

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

• partial involutionsconcept0.828
  Fixed-point free partial injective functions used as simple reversible dynamical processes in Geometry of Interaction.
• Copy-cat processes (partial involutions) are computationally universalfinding0.782
  Mere copying of tokens between paired positions suffices to simulate all partial recursive functions and model higher-order logics.
• Partial orders naturally represent partial information states in computation.hypothesis0.735
  Foundational hypothesis of Domain Theory: partial order structure (D, ⊑) captures information ordering without quantification.
• A family of contrastive learners converges to a representation whose kernel is the pointwise mutual information (PMI) of the underlying eventshypothesis0.728
  Mathematical formalization of what representation models converge to
• Linear Combinatory Logicframework0.723
  A resource-sensitive combinatory algebra with modalities for copying; provides a fine-grained model of computation.
• The interactive processes described are reversible in a very strong sense, linking logic and physicsclaim0.720
  Partial involutions are invertible; the same structures can axiomatize quantum mechanics and analyse entanglement.
• Winner take-all architectures of decision-making are already commonplace in computational neuroscience, and the softmax function provides a smooth approximation.claim0.715
  Neural plausibility argument for softmax policy selection.
• Linear representationconcept0.712
  The idea that features are encoded as directions in activation space.