Establish empirical criteria for identifying primitive computations in artificial systems

Establish empirical criteria and practical tests that distinguish genuine computation of the six Computational Primitives Theory primitives in artificial systems from behavior that merely imitates or resembles those computations.

Background

The paper argues that the six primitives must operate as an integrated system and predicts that they cannot simply be engineered as independent modules. Testing this prediction requires determining whether an artificial system genuinely computes a primitive rather than producing an input-output pattern that resembles one.

Because the primitives are defined at the computational rather than mechanistic level, surface behavior or benchmark performance may not establish that a primitive is present. The paper suggests examining dependence on internal state, generalization beyond training data, and conditions of the system’s own persistence, but presents these only as a first approximation rather than a definitive test.

References

Testing this prediction requires a method to determine whether a machine computes a primitive rather than merely mimicking one, raising questions about empirical evidence for primitives in artificial systems. If the primitives are substrate-neutral computations rather than specific mechanisms, would it be obvious when a machine performed a primitive computation? How would one know? In other words, a system could be engineered to exhibit behavior that resembles a primitive computation while computing nothing of the kind.

— The Computational Primitives of Adaptation  (2609.11989 - Page, 8 Sep 2026) in Section 4.3, pages 22–23