Bibliographic record
Abstract
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function. The classical observation medium for cellular automata, whether Boolean or continuous, is the space-time diagram, where successive rows correspond to successive configurations in time. In this paper we introduce a different way to visualize the evolution of continuous cellular automata called Radial Representation and we employ it to observe a particular class of continuous cellular automata called fuzzy cellular automata (FCA), where the local rule is the fuzzification of the disjunctive normal form that describes the local rule of the corresponding Boolean cellular automata. Our new visualization method reveals interesting dynamics that are not easily observable with the space-time diagram. In particular, it allows us to detect the quick emergence of spatial correlations among cells and to observe that all circular FCA from random initial configurations appear to converge towards an asymptotic periodic behavior. We propose an empirical classification of FCA based on the length of the observed periodic behavior: interestingly, all the minimum periods that we observe are of lengths one, two, four, or n (where n is the size of a configuration).
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".