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 “thermodynamic” 4 papers
Computation theory. Computability, complexity and decidability Tagged papers: 34.
Thermodynamic Feasibility of Tubulin Conformational Switching as a Heat‑Free Parallel Computation Substrate
Cellular information processing is limited by the heat generated during molecular state changes, which constrains the scalability of intracellular computing architectures. The hypothesis that tubulin dimers in microtubules can act as binary switches with near‑Landauer‑limited energy consumption has…
Gödelian Boundary as a Generative Phase Transition: Analytic Derivation of Optimal Operating Points for Constrained Cognitive Systems
Self‑referential cognitive systems—such as self‑improving language models, automated theorem provers, and adaptive controllers—must balance the generation of novel ideas against the risk of incoherent output. Existing designs rely on heuristic thresholds, leaving designers without a principled…
Computation as Hamiltonian Isomorphism: A Mode-Based Taxonomy of Physical Computing Substrates
Special-purpose accelerators, neuromorphic chips, and optical processors are today evaluated by qubit or transistor counts, yet the machines that deliver the largest effective speedups are those whose physical dynamics directly embodies the target problem. This paper addresses a specific gap: no…
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…
New papers by email
One short weekly digest: titles and links. No tracking; unsubscribe any time.