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 “distinction” 1 paper
Computation theory. Computability, complexity and decidability Tagged papers: 34.
The Number Builder: Enclosure Sequences in the Laws of Form Calculus as a Constructive Route to Computable Reals
We address the gap that no minimal, mark‑based formalism has been shown to generate all computable reals. We formalize enclosure sequences as finite Laws of Form (LoF) expressions equipped with a computable re‑entry schedule, define an interpretation that maps each unfolding to a rational…
New papers by email
One short weekly digest: titles and links. No tracking; unsubscribe any time.