MétaCan
Menu
Back to cohort
Record W3192943071 · doi:10.9734/bpi/ctmcs/v7/3406f

The Set of Real Functions are Countable in Applied Mathematics, Algebra of the Functions and Their Classification

2021· book-chapter· en· W3192943071 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

VenueBook Publisher International (a part of SCIENCEDOMAIN International) · 2021
Typebook-chapter
Languageen
FieldComputer Science
TopicComputability, Logic, AI Algorithms
Canadian institutionsArtificial Intelligence in Medicine (Canada)
Fundersnot available
KeywordsCountable setMathematicsSet (abstract data type)Computable functionComputable numberMathematics Subject ClassificationAlgebra over a fieldDiscrete mathematicsElement (criminal law)Infinite setReal numberComputable analysisPure mathematicsComputer science

Abstract

fetched live from OpenAlex

The set of real functions is countable since the functions must be computable, i.e. there must be an algorithm for computing them. But the set of algorithms is countable. Uncomputable functions are useless, they do not exist in applied mathematics. The set of computable real numbers is also countable. Uncomputable numbers are useless. The definition of algebra of computable real functions is given and a classification of subalgebras with one-element bases is constructed. This classification is a classification of functions too. Algebras with multielement bases are fictitious, they are useless for classification of functions. All infinite sequences of inclusions of subalgebras are constructed.

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.002
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: Other · Consensus signal: Other
Teacher disagreement score0.624
Threshold uncertainty score0.975

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0040.001
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.032
GPT teacher head0.238
Teacher spread0.206 · 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