Skip to content
#edge computing Open access

Named Laws Live at Computable Addresses

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)
Quantum Mechanics and Applications Computability, Logic, AI Algorithms

Abstract

Named Laws Live at Computable Addresses Where the NEXUS registry places the latch, the ring oscillator, Griffith’s 8, the diffusive floor, no-cloning, Planck, Gödel and the inverse-square law, and what its one empty slot predicts Driven by Dean A. Kulik September 2026 Abstract Named laws live at addresses. Each named result examined here is the value that one of a few root tests returns when it is evaluated inside a class, at a coordinate, and read through a reader: address = (root, class or signature Σ, coordinate θ, reader R). The list covers the latch and Barkhausen loop-gain-1 condition, the secant condition sec(π/N), Griffith’s 8, the toggle threshold , the resonant rule , the diffusive floor with its telegrapher sweep, the order bound, no-cloning, Duan–Guo’s , Bužek–Hillery’s 5/6, the Gisin–Massar surface with Massar–Popescu’s and Laplace’s rule at its edge, Stinespring–Choi dilation, Landauer’s , the noise law , the Planck/Heisenberg–Robertson floor, the diagonal core of Gödel, and the inverse-square flux law. The claim is operational, not rhetorical. One function, given nothing but class descriptors, returns nine thresholds that the literature publishes under different names: five are genuine reproductions (worst relative error ), one is a correct refusal, two hold by construction and one is a closed form [V]. One Gram inequality returns no-cloning at and Duan–Guo’s rate at its boundary [V]. Robertson–Schrödinger is equivalent to positivity of the 2 × 2 Gram matrix of the deviation vectors, so Planck’s floor sits at the same root as no-cloning (10,000 random trials, zero violations) [V]; the author’s Law 2, “no matter may hold a location without the potential to be moved from that location”, reads as that relation [H]. The resulting registry holds eighteen packages under four roots of different mathematical kind, two verified (loop closure, Gram positivity) and two asserted (dilation, counting measure). It has one slot, local → global, that no registry package resolves, and both corpus families point at it. On the loop side the evidence changed in review. A delayed four-stage ring whose local condition predicts a cycle for τ > 0.1644 shows oscillation at a fixed run length only from 1.25 < τ ≤ 1.5, but at fixed delay the oscillating fraction falls as the run is lengthened: from 37 to 20 of 48 histories at τ = 5, and from 9 to 0 at τ = 2, as T goes from 500 to 4000. The “cycle” is a long transient, as monotone-systems theory requires of a positive loop [V]. Every named result is classical and is cited as such. What is new is the resolver, the root count, the location of the hole, two placements (Planck at the Gram root; Laplace’s rule at the edge of the cloning surface, for which no published statement was found), and a prediction that review has already partly borne out: the next package the system needs is a global one, and for sign-structured loops it is order structure, which the literature already supplies. Readings that turn constants into coordinates, such as π as the half-turn of the phase circle and as one neper per radian, are marked as hypotheses throughout. Contents How to read the status markers.......................................................................................................... 4 1. Laws have location because a resolver can compute it...................................................................... 4 2. An address is a root, a class, a coordinate and a reader..................................................................... 6 2.1 The definition and the resolver..................................................................................................................................... 6 2.2 Three ways to move........................................................................................................................................................ 7 2.3 Why a named law is a boundary, and why every boundary has an address......................................................... 8 3. Map verbs, not values: Sun() becomes Sun(a, b, c, d)....................................................................... 8 3.1 The verb map and what was tested.............................................................................................................................. 9 3.2 The Keyes mapping is an analogy with two tested rows....................................................................................... 10 3.3 The inverse test: predictions written before the chemistry.................................................................................. 10 4. Root 1: loop closure carries half the registry................................................................................... 11 4.1 One characteristic equation for every ring............................................................................................................... 11 4.2 The master phase-closure law and its three corners.............................................................................................. 12 4.3 The transport axis: what one radian of phase costs................................................................................................ 13 4.4 Nine thresholds from one function, and which of them count............................................................................. 15 4.5 Four corrections the placement forced..................................................................................................................... 16 5. Noise is a loan, not a currency....................................................................................................... 17 6. From currencies to arrows: how the taxonomy found its final form................................................. 18 7. Root 2: one Gram inequality holds no-cloning, the cloning surface and Planck’s floor....................... 20 7.1 No-cloning is the p = 1 corner...................................................................................................................................... 20 7.2 Duan–Guo is the boundary of the same test, with one correction...................................................................... 20 7.3 Bužek–Hillery and Massar–Popescu are points on one surface............................................................................ 21 7.4 Laplace’s rule sits at the edge of the surface........................................................................................................... 22 7.5 Planck’s address: Robertson–Schrödinger is Gram positivity, and Law 2 reads as it....................................... 23 8. Roots 3 and 4: dilation and counting measure, grouped by assertion............................................... 25 9. The registry and the runtime it lives in........................................................................................... 26 9.1 Eighteen packages, four roots, one empty slot...................................................................................................... 26 9.2 The runtime as software documentation................................................................................................................. 28 10. The empty slot: local → global..................................................................................................... 30 10.1 A local condition that is right about a state and wrong about the system....................................................... 30 10.2 The same gap in the other family............................................................................................................................. 32 10.3 Two mechanisms for one slot, and where the inverse-square law lives........................................................... 32 10.4 What the slot predicts................................................................................................................................................ 34 11. Gödel’s location: the diagonal root, with incompleteness in the reader.......................................... 34 11.1 One theorem, two faces............................................................................................................................................. 34 11.2 The finite check............................................................................................................................................................ 35 11.3 C1 is Lawvere’s hypothesis, and the corpus puts incompleteness in the reader............................................. 35 11.4 FIX is the open question at this address.................................................................................................................. 36 12. The constraint chain closes, and location is where physics starts................................................... 36 12.1 Ten rungs, each C1 on one more degree of freedom........................................................................................... 36 12.2 Why location is the rung where physics starts....................................................................................................... 38 13. Mathematics has location........................................................................................................... 39 14. Prior frameworks already locate laws; this scheme must predict................................................... 40 15. Method rules and the complete error log...................................................................................... 42 16. What is not new, and every correction......................................................................................... 44 17. Open specifications..................................................................................................................... 47 18. Conclusion..............................................................................................

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 6, 2026

What AI gets wrong and what failure teaches us

Jennifer Neville did not want to go into computer science—but that’s exactly where she landed. Neville discusses the starts and stops that led to her professional sweet spot and her work identifying “surprising failures” making it hard for AI to handle complexity.  The post What AI gets wrong and what failure teaches us appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.