Copy-cat processes (partial involutions) are computationally universal

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

• Mere copying processes (partial involutions) are computationally universalclaim0.899
  The Geometry of Interaction model shows that simple copying of information between locations suffices for all computation, establishing emergent logic.
• "Computational processes are abstract beings that inhabit computers... A computational process is indeed much like a sorcerer's idea of a spirit. It cannot be seen or touched. It is not composed of matter at all."quote0.784
  Load-bearing quote from SICP framing computation as spirit-like; grounds the cyberanimism framework
• Partial involutions form a Linear Combinatory Algebra under function application defined by feedback loopsfinding0.782
  The set of fixed-point free partial involutions on a countable set, with composition via interaction, yields a linear combinatory algebra, hence a universal model of computation.
• partial involutionsconcept0.779
  Fixed-point free partial injective functions used as simple reversible dynamical processes in Geometry of Interaction.
• The fact that one process calls on other processes is not voluntary; it is essential to the nature of the system, just as in arithmetic.claim0.776
  Argues that sequence linkages reflect deep necessity, not option, for the system to work.
• What are the analogues to Turing-completeness and universality when we are concerned with processes and their behaviours?question0.773
  Key open problem: foundational definitions for process models that match the role of Turing completeness for functional computation.
• The interactive processes described are reversible in a very strong sense, linking logic and physicsclaim0.756
  Partial involutions are invertible; the same structures can axiomatize quantum mechanics and analyse entanglement.
• The process itself is to be part of nature.claim0.748