MétaCan
Menu
Back to cohort
Record W2108274236 · doi:10.5539/ijel.v2n5p154

Ordinary Language Problem and Quantum Reality

2012· article· en· W2108274236 on OpenAlexvenueno aff
Jerome P. Mbat, Emmanuel Iniobong Archibong

Bibliographic record

VenueInternational Journal of English Linguistics · 2012
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsnot available
Fundersnot available
KeywordsPerspective (graphical)Ordinary language philosophySpeculationMacroQuantumEpistemologyHabitComputer scienceLinguisticsPsychologyPhilosophyArtificial intelligenceQuantum mechanicsSocial psychologyPhysics

Abstract

fetched live from OpenAlex

Language has severally been viewed as a collection of words, phrases, and sentences. For some, it is a habit system, acquired accidentally and extrinsically. It is further regarded as a structure of forms and concepts based on a system of rules that determine their interrelations, arrangement, and organization. Language also has a relationship with the world and how we talk about the world. It is often likened to a tool, perhaps man’s most important one; more useful it seems than fire, the wheel, or atomic energy. However, language like any tool has its limitations. This limitation is very obvious in the discussions of the behavior of sub-atomic quantum particles of reality since the ordinary everyday language of this macro-world does not fit into the picture of the behavior of elementary particles of physics. This paper attempts to highlight the language difficulties inherent in the discussions of quantum reality from a philosophical perspective using such tools as criticism, analysis and speculation to justify the position that ordinary language is not enough to interpret and explain quantum reality.

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.004
metaresearch head score (Gemma)0.007
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.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.007
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0040.029
Scholarly communication0.0040.012
Open science0.0010.004
Research integrity0.0030.005
Insufficient payload (model declined to judge)0.0040.001

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.013
GPT teacher head0.281
Teacher spread0.269 · 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

Citations0
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of English LinguisticsSame topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207