MétaCan
Menu
Back to cohort
Record W2129577914 · doi:10.1002/cplx.10028

Fuzzy automata and life

2002· article· en· W2129577914 on OpenAlexfundno aff
Clifford A. Reiter

Bibliographic record

VenueComplexity · 2002
Typearticle
Languageen
FieldComputer Science
TopicCellular Automata and Applications
Canadian institutionsnot available
FundersUniversity of Waterloo
KeywordsAutomatonContinuous spatial automatonAutomata theoryComputer scienceFuzzy logicTheoretical computer scienceMobile automatonMathematicsQuantum finite automataArtificial intelligence

Abstract

fetched live from OpenAlex

Abstract Boolean cellular automata may be generalized to fuzzy automata in a consistent manner. Several fuzzy logics are used to create 1‐dimensional automata and also 2‐dimensional automata that generalize the game of life. These generalized automata are investigated and compared to their Boolean counterparts empirically and using rule entropy and repeated input response functions. Fuzzy automata offer new mechanisms for classification of classical automata and can be used for insight into their qualitative behavior. © 2002 Wiley Periodicals, Inc.

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.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.002
Open science0.0000.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.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.086
GPT teacher head0.256
Teacher spread0.170 · 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 designTheoretical or conceptual
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

Citations36
Published2002
Admission routes1
Has abstractyes

Explore more

Same venueComplexitySame topicCellular Automata and ApplicationsFrench-language works237,207