Renormalization and computation I: motivation and background

Abstract

In this paper I argue that infinities in the classical computation theory such as the unsolvability of the Halting Problem can be addressed in the same way as Feynman divergences in Quantum Field Theory, and that meaningful versions of renormalization in this context can be devised. Connections with quantum computation are also touched upon.

49 pages, 1 figure In the new version typos are fixed, minor corrections made, dedication added, reference to Part II added

References in corpus (3)

• Periods and elementary real numbers
• L'Algebre Tropicale Comme Algebre De la Caracteristique 1 : Polynomes Rationnels Et Fonctions Polynomiales
• From operads and PROPs to Feynman Processes

Cited by in corpus (1)

• Renormalization and Computation II: Time Cut-off and the Halting Problem