MétaCan
Menu
Back to cohort
Record W2126946720 · doi:10.1142/s0218196708004913

EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM

2008· article· en· W2126946720 on OpenAlex
George F. McNulty, ZOLTÁN SZÉKELY, Ross Willard

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 · 2008
Typearticle
Languageen
FieldComputer Science
Topicsemigroups and automata theory
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsVariety (cybernetics)MathematicsSignature (topology)Function (biology)Algebra over a fieldFinite-state machineDiscrete mathematicsPure mathematicsAlgorithm

Abstract

fetched live from OpenAlex

We associate to each variety of algebras of finite signature a function on the positive integers called the equational complexity of the variety. This function is a measure of how much of the equational theory of a variety must be tested to determine whether a finite algebra belongs to the variety. We provide general methods for giving upper and lower bounds on the growth of equational complexity functions and provide examples using algebras created from graphs and from finite automata. We also show that finite algebras which are inherently nonfinitely based via the shift automorphism method cannot be used to settle an old problem of Eilenberg and Schützenberger.

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.000
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.480
Threshold uncertainty score0.258

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.0010.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.044
GPT teacher head0.268
Teacher spread0.223 · 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