Renormalization and computation I: motivation and background
arXiv:0904.4921
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 (12)
- Hopf Algebras, Renormalization and Noncommutative Geometry
- Simulating quantum computation by contracting tensor networks
- A Koszul duality for props
- Tropical Geometry of Statistical Models
- Parametric Inference for Biological Sequence Analysis
- Classical computing, quantum computing, and Shor's factoring algorithm
- Feynman graphs, rooted trees, and Ringel-Hall algebras
- Periods and elementary real numbers
- Parametric Feynman integrals and determinant hypersurfaces
- L'Algebre Tropicale Comme Algebre De la Caracteristique 1 : Polynomes Rationnels Et Fonctions Polynomiales
- From operads and PROPs to Feynman Processes
- Tensor networks and the enumeration of regular subgraphs
Cited by in corpus (9)
- Complexity vs Energy: Theory of Computation and Theoretical Physics
- Entropy algebras and Birkhoff factorization
- Numbers as functions
- Decomposition spaces and restriction species
- A computability challenge: asymptotic bounds and isolated error-correcting codes
- Renormalization and Computation II: Time Cut-off and the Halting Problem
- The multiresolution analysis of flow graphs
- Dyson-Schwinger equations in the theory of computation
- A mathematical perspective on the phenomenology of non-perturbative Quantum Field Theory