Halting problem in Feynman graphon processes derived from the renormalization Hopf algebra

DOI10.31926/BUT.MIF.2022.2.64.1.10MaRDI QIDQ6169571zbMATH OpenOpenAlexFDO

Authors Ali Shojaei-Fard

Publication date 14 August 2023

Published in Bulletin of the Transilvania University of Brasov. Series III: Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.31926/but.mif.2022.2.64.1.10

zbMATH Keywords

combinatorial Dyson-Schwinger equationsFeynman graphonsflowchartsgraphons and random graphsrenormalization Hopf algebra of the Halting problemTuring machines

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Applications of computability and recursion theory (03D80) Infinite graphs (05C63) Random graphs (graph-theoretic aspects) (05C80) Hopf algebras and their applications (16T05) Feynman diagrams (81T18)

Recommendations

• Non-perturbative graph languages, halting problem and complexity
• Dyson-Schwinger equations in the theory of computation
• Renormalisation and computation. II: Time cut-off and the halting problem
• Renormalization and computation. I: Motivation and background
• A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence

Cited in

(7)

• Graph polynomials associated with Dyson-Schwinger equations
• From Dyson-Schwinger equations to quantum entanglement
• Subsystems via quantum motions
• Quantum integrability via renormalization
• The ``zero charge problem via graphon processes
• Renormalization bi-Heyting algebra
• A random graph representation for Green's functions

This page was built for publication: Halting problem in Feynman graphon processes derived from the renormalization Hopf algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169571)