Quasinary Computing - WHIRL ASI Technical Report Vol. 1 & 2.
Bibliographic record
Abstract
Quasinary Computing was developed and formalized on February 13, 2025 This book will eventually be separated into 2 seperate volumes. 1 - Quasinary Computing Theory 2 - Quote-Q Programming Language The 3rd volume about the Topological Quasinary QPU (Q-QPU) will also appear on Zenodo as of March 03, 2025. Reimagining Computation Beyond Binary Traditional computation is built on binary logic, where information isencoded in discrete states: 0 and 1. Quantum computing extends thisparadigm by introducing superposition and entanglement, allowing qubitsto exist in multiple states simultaneously. However, both classical and quantumcomputing remain bound to predefined logical operations, requiringexplicitly defined states, circuits, and transitions. Quasinary Computation challenges this paradigm by treating computationas an emergent process, where computational results arise throughgestalt perception, structured tiling formations, and Hamiltonianenergy landscapes rather than deterministic state changes. This book introduces:• Quasinary Computation: A framework where information emergesdynamically through perceptual fields and structured quantumtopologies.• Quote-Q: The first programming language designed to encode Quasinarylogic, integrating tiling mechanisms, topological braiding,and structured computational perception.• Gestalt Quantum Computation: A concept where computationalstates topologically emerge as perceptible holograms within structured quantuminterference patterns.Reimagining Computation Beyond Binary LogicTraditional computation is built on binary logic, where information isencoded in discrete states: 0 and 1. Quantum computing extends thisparadigm by introducing superposition and entanglement, allowing qubitsto exist in multiple states simultaneously. However, both classical and quantumcomputing remain bound to predefined logical operations, requiringexplicitly defined states, circuits, and transitions. Quasinary Computation challenges this paradigm by treating computationas an emergent process, where computational results arise throughgestalt perception, structured tiling formations, and Hamiltonianenergy landscapes rather than deterministic state changes. This book introduces:• Quasinary Computation: A framework where information emergesdynamically through perceptual fields and structured quantumtopologies.• Quote-Q: The first programming language designed to encode Quasinarylogic, integrating tiling mechanisms, topological braiding,and structured computational perception.• Gestalt Quantum Computation: A concept where computationalstates emerge as perceptible holograms within structured quantuminterference patterns.Unlike traditional computational approaches:• Classical Computation processes information using discrete, stepwiseBoolean logic.• Quantum Computation operates using superposition but still relieson defined quantum states (|0⟩, |1⟩).• Quasinary Computation does not store information in explicit logicalstates but allows computation to emerge dynamically via topologicaland gestalt-driven interactions. Analogy: If classical computation is like writing words letter by letter,Quasinary computation is like viewing a stereogram, where meaningappears through structured perception rather than predefined symbolmanipulation.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.005 | 0.007 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.099 | 0.063 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".