Jul 2026· Zenodo (CERN European Organization for Nuclear Research)
Noncommutative and Quantum Gravity Theories
Abstract
This article develops a joint state-law fixed-point method for self-consistent quantum models. A physical model is represented by a density operator and a finite-dimensional vector of effective law parameters; admissible dynamics consist of a state-update channel and a law-update map. A recursive solution is their joint fixed point. This formulation separates stationarity of a state-dependent Hamiltonian from genuine co-determination of states and laws and preserves the option of completely positive trace-preserving subsystem dynamics. Three general results are obtained: existence for continuous maps on compact convex state-law domains, uniqueness and iterative stability under a contraction condition, and persistence of non-degenerate fixed points under weak deformation. An exactly solvable two-state model displays a supercritical pitchfork bifurcation, critical exponent one-half, and a divergent zero-field susceptibility at the feedback threshold. In renormalization-group theory space, the same perturbative result yields first-order shifts of fixed-point coordinates and critical exponents. An action-level construction shows how recursive consistency operators can enter the standard functional flow without adding ad hoc terms to the Wetterich equation. Covariant gravity and laboratory phase-shift formulas are presented as conditional templates whose predictions require a specified kernel and normalization. The framework therefore contributes a broadly applicable method linking quantum channels, nonlinear dynamics, fixed-point theory, and renormalization-group deformations, while making no claim to a completed theory of quantum gravity.
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.· arXiv.org· 727 citations· ⚡54
Supporting data, adapters, predictions and code for the article *Low-Cost LoRA Fine-Tuning of Small Language Models for Multi-Step Arithmetic Reasoning* by Jake O'Grady, Asena Isik Gürhan, Chee Fong Ting and Effirul Ramlan (University of Galway). We generated 20,000 GSM8K-derived arithmetic problems with step-by-step s...
O'Grady, Jake, Gürhan, Asena Isik, Chee, Fong Ting et al.· Zenodo (CERN European Organi...· 465 citations
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.· Empirical Software Engineeri...· 401 citations· ⚡48
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.· Information and Software Tec...· 394 citations· ⚡54
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar 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.