Renormalization and computation I: motivation and background

TL;DR

This paper explores how concepts from renormalization in quantum field theory can be applied to address infinities in classical computation theory, such as the Halting Problem, and discusses links to quantum computation.

Contribution

It introduces a novel approach to handling infinities in classical computation using renormalization techniques inspired by quantum field theory.

Findings

Proposes a renormalization framework for classical computation infinities

Draws parallels between quantum field theory divergences and computational unsolvability

Suggests potential connections with quantum computation

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.