Open research library
Papers you can read, cite and question
728 papers from the QNFO program, filed on nine shelves by the reader each one is written for: energy per answer, error correction, physics, numbers and p-adics, logic and formalism, AI and knowledge, autonomous systems, assessments, and cross-cutting essays. Every page renders its mathematics and can be questioned in place. How a living paper works.
Looking for an answer rather than a paper? Ask the whole corpus: answers cite the papers they come from.
Results for “topological” 2 papers
Formal verification. Contracts, assertions and verified implementations Tagged papers: 33.
Deductive Verification of Discrete‑Time Quantum‑Walk Simulators: Contracts, Cost Bounds, and Extensions to Graph‑Generalized and Open‑System Walks
Discrete‑time quantum walks are a universal model of quantum computation, a platform for topological phases, and a testbed for quantum algorithms, yet the simulators used to study them are rarely checked with the rigor applied to classical library code. This paper frames quantum‑walk simulator…
Strange Loop Formal Derivation
This paper presents a rigorous mathematical derivation of the Standard Model of particle physics as the unique, stable solution to a universal fixed-point equation. Starting from the Principle of Informational Stability—the axiom that the universe must preserve information to sustain stable…
New papers by email
One short weekly digest: titles and links. No tracking; unsubscribe any time.