"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."

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

• Computation is a game of empowerment and, therefore, the investment in opening the design process remains a critical challenge for contemporary architecture.claim0.803
  Final normative claim: computation’s nature as a game demands architectural openness, a challenge yet to be met.
• A computer program is not defined by its language or hardware but as an abstract causal pattern, a dynamic mathematical structure that influences the physical universe without violating its causal closure.claim0.799
  Paper's ontological characterization of software enabling cyberanimism
• We hypothesize that general computational machines with sufficient resources possess the necessary and sufficient means to implement consciousness, and that successful implementation can be established via analysis or testing.hypothesis0.796
  The central hypothesis of the paper
• 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.795
  Argues that sequence linkages reflect deep necessity, not option, for the system to work.
• The process itself is to be part of nature.claim0.790
• General computational machines with sufficient resources possess the necessary and sufficient means to implement consciousnesshypothesis0.790
  CIMC's central testable hypothesis grounding the entire research program
• Copy-cat processes (partial involutions) are computationally universalfinding0.784
  Mere copying of tokens between paired positions suffices to simulate all partial recursive functions and model higher-order logics.
• The interactive processes described are reversible in a very strong sense, linking logic and physicsclaim0.781
  Partial involutions are invertible; the same structures can axiomatize quantum mechanics and analyse entanglement.