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.
Logic & formalism papers 4 papers
Logicians, formal-methods and foundations readers. Formal systems and what they cannot say: Laws of Form and the calculus of indications, distinction and re-entry, self-reference, category theory, coalgebra and bisimulation, proof assistants, computability, formal ontology.
Computation theory. Computability, complexity and decidability Tagged papers: 17.
The Oscillator as an Element: Static and Dynamical Analyses of the Imaginary Boolean Value in the Algebra of Eventually Periodic Truth Sequences
Revision-theoretic treatments of the liar paradox produce an oscillator $\iota = \langle U,P,U,P,\ldots\rangle$ that alternates between two states forever, but they leave $\iota$ a process rather than a value. This paper tests the conjecture that $\iota$ can be promoted to a static element of a…
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 metaphysical claim…
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).
Excluded Middle as Computational Boundary
This research investigates the validity of the constructivist critique of Turing completeness, which is founded upon the rejection of the Principle of the Excluded Middle (PEM). By employing a systematic, multi-layered framework, this paper deconstructs the logical chain from L.E.J. Brouwer’s…
New papers by email
One short weekly digest: titles and links. No tracking; unsubscribe any time.