Institution
Camber Collective (United States)
Recent research
- AI & ComputingOpen access
The Physics of Computation: Fundamental Limits and the Honest Boundaries of Post-Classical Computing
Phase III of the Qubit Delusion series. Examines fundamental physical limits on computation: Landauer bound, Margolus-Levitin theorem, Bremermann limit, Bekenstein bound. Shows that quantum error-correction overhead (1e2-1e3 physical operations per logical operation) multiplies t...
- AI & ComputingOpen access
The Problem-Substrate Mapping: A Framework for Honest Computational Investment
Phase IV of the Qubit Delusion series. Translates the critique into a concrete investment portfolio: matching computational problem classes (optimization, linear algebra, probabilistic inference, quantum simulation, cryptography, general-purpose) to optimal physical substrates (I...
- Engineering & TechnologyOpen access
--- author: Rowan Brad Quni email: rowan.quni@qnfo.org website: http://qnfo.org ORCID: 0009-0002-4317-5604 ISNI: 0000000526456062 robots: By accessing this content, you agree to https://qnfo.org/LICENSE. Non-commercial use only. Attribution required. DC.rights: https://qnfo.org/L...
- AI & ComputingOpen access
The Problem-Substrate Mapping: A Framework for Honest Computational Investment
Phase IV of the Qubit Delusion series. Translates the critique into a concrete investment portfolio: matching computational problem classes (optimization, linear algebra, probabilistic inference, quantum simulation, cryptography, general-purpose) to optimal physical substrates (I...
- Physics & SpaceOpen access
Beyond the Qubit: Constructive Paradigms for Post-Particle Computation
Companion paper to "The Qubit Delusion" (v1.1, 10.5281/zenodo.21254143). If the qubit-gate-circuit model is an epistemic failure — a projection of particle ontology onto relational, field-theoretic reality — what comes next? We strip quantum mechanics to its minimal ontological c...
- Engineering & TechnologyOpen access
--- author: Rowan Brad Quni email: rowan.quni@qnfo.org website: http://qnfo.org ORCID: 0009-0002-4317-5604 ISNI: 0000000526456062 robots: By accessing this content, you agree to https://qnfo.org/LICENSE. Non-commercial use only. Attribution required. DC.rights: https://qnfo.org/L...
- Society & EconomicsOpen access
--- author: Rowan Brad Quni email: rowan.quni@qnfo.org website: http://qnfo.org ISNI: 0000000526456062 ORCID: 0009-0002-4317-5604 robots: By accessing this content, you agree to https://qnfo.org/LICENSE. Non-commercial use only. Attribution required. DC.rights: https://qnfo.org/L...
- Society & EconomicsOpen access
--- author: Rowan Brad Quni email: rowan.quni@qnfo.org website: http://qnfo.org ISNI: 0000000526456062 ORCID: 0009-0002-4317-5604 robots: By accessing this content, you agree to https://qnfo.org/LICENSE. Non-commercial use only. Attribution required. DC.rights: https://qnfo.org/L...
- Engineering & TechnologyOpen access
--- author: Rowan Brad Quni email: rowan.quni@qnfo.org website: http://qnfo.org ISNI: 0000000526456062 ORCID: 0009-0002-4317-5604 robots: By accessing this content, you agree to https://qnfo.org/LICENSE. Non-commercial use only. Attribution required. DC.rights: https://qnfo.org/L...
- Engineering & TechnologyOpen access
--- author: Rowan Brad Quni email: rowan.quni@qnfo.org website: http://qnfo.org ISNI: 0000000526456062 ORCID: 0009-0002-4317-5604 robots: By accessing this content, you agree to https://qnfo.org/LICENSE. Non-commercial use only. Attribution required. DC.rights: https://qnfo.org/L...
- AI & ComputingOpen access
This record contains the paper and reproducibility package for a cell-probe lower bound that rules out always-correct succinct constant-time dynamic fusion nodes in the fixed-layout packed-memory model. The package includes the full Lean 4 formalization for deterministic and fres...
- AI & ComputingOpen access
We study adaptive intervention design for orienting causal directed acyclic graphs within an observational Markov equivalence class under a uniform prior and atomic perfect interventions. We prove that the compelled-edge reward is adaptively monotone and adaptively submodular whe...
- AI & ComputingOpen access
A Constant-Competitive Algorithm for Dynamic Mixture-of-Experts Serving
Huang, Lou, and Xiao introduced Dynamic Mixture-of-Experts Serving and gave an O(sqrt(log k))-competitive randomized algorithm for the integral primal, leaving the primal order open. This preprint proves that the randomized primal competitive ratio is Theta(1) for arbitrary numbe...