Dyson-Schwinger equations in the theory of computation
arXiv:1302.5040
Abstract
Following Manin's approach to renormalization in the theory of computation, we investigate Dyson-Schwinger equations on Hopf algebras, operads and properads of flow charts, as a way of encoding self-similarity structures in the theory of algorithms computing primitive and partial recursive functions and in the halting problem.
26 pages, LaTeX, final version, in "Feynman Amplitudes, Periods and Motives", Contemporary Mathematics, AMS 2015
References in corpus (7)
- A Koszul duality for props
- Integrable Renormalization II: the general case
- Hopf algebras in renormalization theory: Locality and Dyson-Schwinger equations from Hochschild cohomology
- Insertion and Elimination: the doubly infinite Lie algebra of Feynman graphs
- Renormalization and computation I: motivation and background
- Renormalization and Computation II: Time Cut-off and the Halting Problem
- Zipf's law and L. Levin's probability distributions