MétaCan
Menu
Back to cohort
Record W7096730804

About the Cover … and a Bit

2008· article· en· W7096730804 on OpenAlexaboutno aff

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicHistory of Computing Technologies
Canadian institutionsnot available
Fundersnot available
KeywordsBit (key)CalculatorSurpriseCover (algebra)DecimalBlueprintKey (lock)
DOInot available

Abstract

fetched live from OpenAlex

in the mid-1930s, one presumably capable of performing—albeit slowly—any calculation that could be performed by anyone at any time. But a bit later in the same decade he designed two rather more physical machines, ones that were by no means universal. The first was a project of his while he was in Princeton, in 1937, and was assembled from relays that he built himself in the workshop of the Princeton physics department. This was to some extent a collaboration with a Canadian graduate student in physics named Malcolm MacPhail, who wrote in a letter to Turing’s biographer, Andrew Hodges, “my small contribution to the project was to lend Turing the key to the shop, which was probably against all the regulations, and to show him how to use the lathe, drill press, (etc.) without chopping off his fingers. And so, he wound the relays; and to our surprise and delight the calculator worked. ” The machine apparently did only one task—it multiplied two integers in binary format, which at that time, when adding machines all used decimal format, would have been an innovation. The second machine was the one whose blueprint is on the cover and the preceding pages. Its purpose was to assist in verifying the Riemann hypothesis. It was designed in

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.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.366
Threshold uncertainty score0.904

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0030.001
Scholarly communication0.0050.007
Open science0.0010.002
Research integrity0.0030.004
Insufficient payload (model declined to judge)0.3660.227

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.024
GPT teacher head0.216
Teacher spread0.193 · 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.

Study designNot applicable
Domainnot available
GenreOther

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

Citations0
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicHistory of Computing TechnologiesFrench-language works237,207