Kolmogorov Complexity

Used to argue that self-modifying trajectories incorporating environmental information are incompressible.

Neighborhood — ranked by edge-count

paper

concept

Rice's Theorem
associated_with
No general algorithm decides non-trivial semantic properties of self-modifying trajectories.

cosine ≥ 0.65 · no typed edge

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

Kolmogorov-Smirnov Testmethod0.793
Used to measure distributional alignment between simulated and human donation amounts in dialogue simulation
functional complexityconcept0.739
Flusser’s category of complexity where a system provides a complex use (like chess), enabling creative plays.
Environmental Complexityconcept0.727
Thesis that complexity of environment drives cognitive evolution; mentioned in relation to sensorimotor organization.
Can we characterize polynomial-time computation and other complexity classes in such terms?question0.719
Hoping for machine-independent, geometrical characterizations of complexity classes via interaction models.
Complexity spectrum of environmentsconcept0.712
The graduated range of environment difficulties (six environments) employed to probe how causal emergence relates to performance across challenges.
Complexity Theoryframework0.711
The class of explanations from the Santa Fe Institute tradition, including attractor dynamics and emergent order, evaluated as insufficient to fully explain the appearance of living structure
structural complexityconcept0.710
Flusser’s category of complexity where the system elements have very complex internal relationships (like apparatus).
Kabsch-Umeyama Algorithmmethod0.701
Used to align color embedding with CIELAB space by finding best rotation, translation, scaling, and flipping