Article contents
Renormalisation and computation II: time cut-off and the Halting Problem
Published online by Cambridge University Press: 06 September 2012
Abstract
This is the second instalment in the project initiated in Manin (2012). In the first Part, we argued that both the philosophy and technique of perturbative renormalisation in quantum field theory could be meaningfully transplanted to the theory of computation, and sketched several contexts supporting this view.
In this second part, we address some of the issues raised in Manin (2012) and develop them further in three contexts: a categorification of the algorithmic computations; time cut-off and anytime algorithms; and, finally, a Hopf algebra renormalisation of the Halting Problem.
- Type
- Paper
- Information
- Mathematical Structures in Computer Science , Volume 22 , Special Issue 5: Computability of the Physical , October 2012 , pp. 729 - 751
- Copyright
- Copyright © Cambridge University Press 2012
References
- 12
- Cited by