- Visual Graphs vs Matrices: Epistemic Limits, Cognitive Preference, and the Design of Understandable Computation
The ZX calculus and the matrices of linear algebra denote exactly the same maps. A field that knows this has, nonetheless, converged on the pictures. This paper argues that the convergence is not a matter of taste and not a matter of mathematics: it is a fact about bounded cognit
- Epistemic Legibility in AI-Assisted Science: Ignorance Auditing as a Governance Instrument for the Peer-Review and Evaluation Bottleneck
As AI systems take on hypothesis generation, experiment planning, analysis, and writing, the scientific ecosystem faces a new bottleneck: not production, but evaluation, verification, and governance. This position paper contributes a documented case and an instrument to that prob
- Prioritizing Large Language Models for Scientific Research and Agentic AI: A LiveBench-Grounded Audit (August 2026)
An audit of the frontier large-language-model landscape (August 2026) for mathematics-heavy scientific research and agentic AI, grounded in the LiveBench 2026-06-25 contamination-free benchmark. Findings: no Llama model ranks in the top 42; DeepSeek V4 Pro 0813 is the mathematics
- QWAV Strategy v2.4.1: The Energy-Standard Playbook — Consortium Governance, Verified Precedents, and the JPCUB Road to a Quantum Computing Energy Benchmark
QWAV Quantum Software possesses a validated technical differentiator in JPCUB, but the SaaS go-to-market model carries a structural weakness. This paper proposes the JPCUB Consortium model combined with grant-funded core R&D, transforming JPCUB from a single-vendor product into a
- JPCUB as a Leading Indicator of Computing Paradigm Shifts: Retrospective Validation and Prospective Forecast
Abstract The computing industry lacks a single, cross-domain metric that can compare energy efficiency across fundamentally different paradigms — CPU, GPU, neuromorphic processor, in-memory accelerator, or spintronic logic. Traditional metrics (FLOPS, MIPS, transistor count) des
- Autaxys Ontological Closure: When Is a Physical Quantity Computationally Real?
We propose an operational criterion for physical reality: a quantity is physically real only if there exists a finite Turing-machine protocol that approximates it with a computable modulus of convergence, yielding measurement-distinguishable predictions. This criterion is not a m
- The Substrate Is the Algorithm: A Categorical Formalization of the Strongest Consilience Thread
ACRP-05: Thread 3 formalization. Capability(S) ~ End(X_S) conjecture; five-pillar verification; Church-Turing-scoped resource-level thesis (computability-level equivalence, resource-level difference).
- HM-LWE v3.0
Hidden-modulus LWE: novel hardness assumption
- The Joules-per-Solution Metric: Definition, Measurement Protocol, and Anti-Gaming Provisions for Honest Computational Benchmarking
We define and formalize the joules-per-solution (J/S) metric as a universal, cross-domain measure of computational energy efficiency. The metric accounts for six energy components: computation, memory, I/O, cooling, power conversion, and amortized manufacturing. We provide a clos
- CFPE Methodology v2.0: Cascading Bayesian Foresight Engine with Historical Back-Casting Calibration
The Cascading Bayesian Foresight Engine (CFPE) methodology for generating and stress-testing long-range paradigm-shift forecasts: Bayesian cascading dependency models, adversarial red-teaming, evidence strength grading, fault-tree decomposition, counterfactual pathway generation,
- Spin Glasses and Complexity: Replica Symmetry Breaking, Frustration, and the Statistical Mechanics of Disordered Systems
Review of spin glass theory, Parisi RSB, and applications to neural networks and optimization.
- Manifesto for Honest Computation
Phase VI (Final Synthesis). 5 principles, a concrete portfolio, the Falsification Pledge.
- Institutional Reform: Fixing the Epistemic Incentive Structure of Post-Classical Computing
Phase V of the Qubit Delusion series. Diagnoses the institutional incentive structure that produced the $35B quantum computing bubble with zero viable output. Analyzes the structural mismatch between VC timelines and deep tech development, the prestige cascade in academic publish
- Geometric Unity of Computation
2026-07-04CS
- Biological and Engineered Computational Systems
2026-07-04CS
- Computational Simulation Approach to Non-Archimedean Quantum Architectures
2026-07-04CS
- Computational Simulation of Geometric Orientation Codes
2026-07-04CS
- Computational Syntax of Reality
2026-07-04CS
- Algorithmic-Necessity-of-Agency
2026-07-04CS
- Computational Topology and Formal Proofs of Discrete Non-Archimedean Relational Networks
2026-07-04CS
- Automated Formal Verification and Combinatorial Reduction of Distinction-Based Calculus
2026-07-04CS
- Universal Computational Topos
2026-07-04CS
- Computational Toy Model of Non-Local Information Storage in a Quantum Cellular Automaton
- Epistemic Noise as Computational Resource
2026-07-04CS
- Excluded Middle as Computational Boundary
2026-07-04CS
- Hamiltonian Dynamics as the Engine of Biological Computation
2026-07-04CS
- Emergent Computation
2026-07-04CS
- Risks of Pancomputationalism
2026-07-04CS
- Silent-Radix Cryptography: Exploiting the Base Ambiguity of Positional Notation as a Cryptographic Primitive
The silent radix — a positional numeral cannot internally specify its own base — is a cryptographic primitive. Silent Radix Encryption (SRE) uses a secret base b as a trapdoor for key encapsulation. Security reduces to an unknown-weight integer knapsack problem.