arXiv:1302.5040 [math-ph]AbstractReferencesReviewsResources
Dyson-Schwinger equations in the theory of computation
Colleen Delaney, Matilde Marcolli
Published 2013-02-20, updated 2015-01-24Version 2
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.
Comments: 26 pages, LaTeX, final version, in "Feynman Amplitudes, Periods and Motives", Contemporary Mathematics, AMS 2015
Related articles: Most relevant | Search more
arXiv:0810.2249 [math-ph] (Published 2008-10-13)
Growth estimates for Dyson-Schwinger equations
On the computation of star products
arXiv:0907.0689 [math-ph] (Published 2009-07-03)
Computation of fluxes of conservation laws