Renormalisation and computation II: time cut-off and the Halting Problem
2012 ◽
Vol 22
(5)
◽
pp. 729-751
◽
Keyword(s):
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.
1999 ◽
Vol 08
(02)
◽
pp. 125-163
◽
2013 ◽
Vol 28
(35)
◽
pp. 1350163
◽
Keyword(s):
2001 ◽
Vol 16
(09)
◽
pp. 1531-1558
◽
Keyword(s):
2012 ◽
Vol 27
(17)
◽
pp. 1250097
◽
Keyword(s):
2000 ◽
Vol 210
(1)
◽
pp. 249-273
◽
2009 ◽
Vol 282
(12)
◽
pp. 1664-1690
◽
2005 ◽
Vol 17
(08)
◽
pp. 881-976
◽