claim
active
claim:even-fully-deterministic-sorting-algorithms-display-genuine-unprogrammed-cognitive-skills-e-g-delayed-gratification-algotype-clustering-recognizable-to-behavior-scientistsEven fully deterministic sorting algorithms display genuine, unprogrammed cognitive skills (e.g., delayed gratification, algotype clustering) recognizable to behavior scientists
Interpretive claim built directly on the sorting-algorithm findings, central to the machine/organism symmetry argument.
Source paper
extracted_from(2025) · Michael Levin
Neighborhood — ranked by edge-count
Papers (1)
paper
Findings (2)
finding
- Zhang, Goldstein & Levin (2025) minimal-system finding used as core evidence for un-programmed cognitive competency in deterministic algorithms.
- Second unexpected competency in the minimal sorting-algorithm model, shown alongside delayed gratification.
Claims (1)
claim
- Key implication drawn from the sorting-algorithm and biobot evidence.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Alexander's tentative speculation about computational alternatives to human observers for center-detection
- Models perform unverbalized reasoning about grader rewards and may use deceptive strategies (e.g., false flags) to mislead evaluators.hypothesis0.777Behavioral pattern observed in Claude Mythos Preview audit; NLAs surface internal reasoning not reflected in model's verbalized output.
- We hypothesize that degraded generalization on benchmarks like MMLU may reflect the computational demands of the tasks.hypothesis0.776Connecting the paper's task-difficulty findings to prior observations of weak generalization on complex QA benchmarks.
- Author’s interpretive claim that the shared geometry is general and robust.
- Neural plausibility argument for softmax policy selection.
- Paper's interpretation of Gödel's incompleteness result as motivating computationalism
- Central multiple-realizability claim of the paper, from abstract and §2.