Dyson-Schwinger equations in the theory of computation
classification
🧮 math-ph
math.MP
keywords
theorycomputationdyson-schwingerequationsalgebrasalgorithmsapproachcharts
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.