Open research library
Papers you can read, cite and question
611 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.
Numbers & p-adics papers 7 papers
Mathematicians. Valuation theory and the p-adic and adelic programme, Bruhat-Tits trees and ultrametric geometry as mathematics, Ostrowski's theorem, numeral and radix systems, primes, arithmetic and algebraic structures, zeta and gamma functions.
Computation theory. Computability, complexity and decidability Tagged papers: 17.
Factoring Hardness as a Bayesian Prior: A Decision-Theoretic Model of Post-Quantum Cryptography Migration Timing
The urgency of post-quantum cryptography (PQC) migration is usually justified by the anticipated capability of quantum computers to factor integers, yet that threat rests on an unproven complexity-theoretic conjecture: that integer factoring is not in BPP, the class of decision problems solvable in…
Emergent Universality from Symmetric Rules: Rule-110 Emulation by Alternating Trivial Cellular Automaton Rules
Elementary cellular automaton (ECA) rule 110 is Turing complete, yet its local rule is chiral: it treats its left and right neighbours differently, and this handedness underlies the glider dynamics that carry its computation. A recent construction shows that rule 110 can nevertheless be emulated by…
The Number Builder: Enclosure Sequences in the Laws of Form Calculus as a Constructive Route to Computable Reals
We propose and partially develop the Number Builder conjecture: every computable real can be generated by a finite specification of a re-entry structure in Spencer-Brown's Laws of Form (LoF) calculus of distinctions, in which each re-entry step appends a nested rational enclosure whose interval…
FACTORING, Adelic Complexity, and the Silent-Radix Principle
The silent radix -- the observation that no positional numeral internally specifies its own base -- was previously explored as a cryptographic primitive through Silent Radix Encryption (SRE), a key encapsulation mechanism whose security rests on the hardness of recovering a secret base from public…
The Computable Continuum: Depth Without Breadth
The uncountability of the real numbers conflates Archimedean completeness (depth) and set-theoretic cardinality explosion (breadth). All physically relevant properties are preserved by computable reals.
Dual-Mode Arithmetic Representation
This presents a framework that resolves the apparent incompatibility between algebraic and geometric representations of natural numbers. We demonstrate that while static two-dimensional coordinate systems are informationally incomplete for capturing the full arithmetic structure of prime…
COMMUTATIVE PHYSICS
Mathematics serves as the fundamental language through which the intricate laws and diverse phenomena of the physical universe are articulated, modeled, and predicted. The selection of mathematical tools is not a trivial matter; it profoundly shapes our comprehension of reality. Modern physics…
New papers by email
One short weekly digest: titles and links. No tracking; unsubscribe any time.