MétaCan
Menu
Back to cohort

Sequences of Preimages in Elementary Cellular Automata

2003· article· en· W1718957939 on OpenAlexfundno aff
Henryk Fukś

Bibliographic record

VenueComplex Systems · 2003
Typearticle
Languageen
FieldComputer Science
TopicCellular Automata and Applications
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCellular automatonElementary proofMathematicsAutomatonComputer scienceArtificial intelligencePure mathematicsAlgorithm

Abstract

fetched live from OpenAlex

Regularities are searched for in the sequences of numbers of preimages for elementary cellular automata (CA). For 46 out of 88 "minimal" rules, recognizable patterns are found, usually in the form of second order recurrence equations with constant coefficients. After introducing the concept of asymptotic emulation of CA rules, it is shown how the regularities in the sequences of preimage numbers can be used to find rules emulating identity. It is also shown that the average density of nonzero sites after an arbitrary number of steps (starting from a disordered configuration) can be computed using the sequences of preimage numbers.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.005
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.035
GPT teacher head0.260
Teacher spread0.225 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueComplex SystemsSame topicCellular Automata and ApplicationsFrench-language works237,207