Related papers: Fast-collapsing theories
We argue that one of the following statements must be true: (a) extensive violations of quantum information theory's additivity conjectures exist or (b) there exists a set of `disentangled' black hole microstates that can account for the…
The Trajectory Class Fluctuation Theorem (TCFT) substantially strengthens the Second Law of Thermodynamics -- that, in point of fact, can be a rather weak bound on resource fluxes. Practically, it improves empirical estimates of free…
It is shown that the Poincar\'e-Birkhoff fixed point theorem may be proven by extending the geometric approach originally devised by Henri Poincar\'e himself, along with several results from elementary differential topology. Beginning with…
We investigate four model-theoretic tameness properties in the context of least fixed-point logic over a family of finite structures. We find that each of these properties depends only on the elementary (i.e., first-order) limit theory, and…
It is known that superluminal transmission of information and energy contradicts Einstein's relativity. Here we announce an unusual TOE called 'nature theory' in which impossible things become possible. We present the scheme of an apparatus…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
Rigidity regulates the integrity and function of many physical and biological systems. This is the first of two papers on the origin of rigidity, wherein we propose that "energetic rigidity," in which all non-trivial deformations raise the…
This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…
A compactness theorem is proved for a family of K\"{a}hler surfaces with constant scalar curvature and volume bounded from below, diameter bounded from above, Ricci curvature bounded and the signature bounded from below. Furthermore, a…
The paper provides the proof of the Rimann's conjecture. The results of the works of A. M. Odlyzko and H. te Riile "Disproof of the Conjecture", which gives a disproof of the Mertens hypothesis, using to prove the Riemann's hypothesis. This…
Over the past few years the arithmetic Langlands program has proven useful in addressing physical problems. In this paper it is shown how Langlands' reciprocity conjecture for automorphic forms, in combination with a representation…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below…
By changing variables in a suitable way and using dominated convergence methods, this note gives a short proof of Stirling's formula and its refinement.
We propose using mechanistic interpretability -- techniques for reverse engineering model weights into human-interpretable algorithms -- to derive and compactly prove formal guarantees on model performance. We prototype this approach by…
It is not uncommon in analysis that existence of extremal objects is obtained via an iterative procedure: we start from a given admissible object, then modify it, then modify again etc... If being extremal means maximimizing a real valued…
We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…
We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…
Automated decision support systems that are able to infer second opinions from experts can potentially facilitate a more efficient allocation of resources; they can help decide when and from whom to seek a second opinion. In this paper, we…
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…