MétaCan
Menu
Back to cohort
Record W4403712557 · doi:10.1142/s021819672450053x

LEF-groups and computability of reversible endomorphisms of symbolic varieties

2024· article· en· W4403712557 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Algebra and Computation · 2024
Typearticle
Languageen
FieldComputer Science
TopicComputability, Logic, AI Algorithms
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsEndomorphismMathematicsComputabilityPure mathematicsDiscrete mathematicsAlgebra over a field

Abstract

fetched live from OpenAlex

Fix a group G and let X be an algebraic variety over an algebraically closed field k of characteristic zero. We investigate the invertibility of algebraic cellular automata, namely, G-equivariant uniformly continuous self-maps [Formula: see text] whose local defining maps are induced by morphisms of algebraic varieties [Formula: see text] where [Formula: see text] is a finite memory set. When G is locally embeddable into finite groups (LEF), we show that the inverses of reversible algebraic cellular automata are automatically algebraic cellular automata and thus computable in polynomial time. Generalizations are also obtained for finite product Hopfian pointed object alphabets in concrete categories. Moreover, we prove that for algebraic cellular automata, the notions of reversibility and injectivity are equivalent whenever G is surjunctive and the field k is, additionally, uncountable of arbitrary characteristic.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.503
Threshold uncertainty score0.479

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.012
GPT teacher head0.265
Teacher spread0.252 · 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