Renormalisation and computation ii: Time cut-off and the halting problem

Authors:
Yuri i. Manin
Affiliations:
Max planck institut für mathematik, bonn, germany and northwestern university, evanston, u.s.a.
Venue:
Mathematical Structures in Computer Science
Year:
2012

Citing 5
Cited 1

An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications
Reasoning about computational resource allocation

Crossroads - Special issue on artificial intelligence
Natural halting probabilities, partial randomness, and zeta functions

Information and Computation
Composing real-time systems

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Towards a Definition of an Algorithm

Journal of Logic and Computation

Algorithmic thermodynamics

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.