Published 2015
| Submitted
Book Section - Chapter
Open
Dyson-Schwinger equations in the theory of computation
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.
Additional Information
© 2015 American Mathematical Society. The first author was supported for this project by the Summer Undergraduate Research Fellowship (SURF) program of Caltech, through a Herbert J. Ryser fellowship. The second author is partially supported by NSF grants DMS-0901221, DMS-1007207, DMS-1201512, and PHY-1205440. The second author acknowledges MSRI for hospitality and support. The authors are especially grateful to Joachim Kock for many helpful comments and suggestions that significantly improved the paper.Attached Files
Submitted - 1302.5040v2.pdf
Files
1302.5040v2.pdf
Files
(353.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:e0f871f75e6e57b842e0408cd6458312
|
353.7 kB | Preview Download |
Additional details
- Eprint ID
- 62441
- Resolver ID
- CaltechAUTHORS:20151130-084148729
- Caltech Summer Undergraduate Research Fellowship (SURF)
- DMS-0901221
- NSF
- DMS-1007207
- NSF
- DMS-1201512
- NSF
- PHY-1205440
- NSF
- Created
-
2015-11-30Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field
- Series Name
- Contemporary Mathematics
- Series Volume or Issue Number
- 648