Skip to main content

Renormalisation and computation II: time cut-off and the Halting Problem

  • YURI I. MANIN (a1)

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.

Hide All
Baez, J. and Stay, M. (2010) Physics, topology, logic and computation: a Rosetta stone. In: Coecke, B. (ed.) New Structures for Physics. Springer-Verlag Lecture Notes in Physics 813 95172. (Available at arXiv:0903.0340.)
Calude, C. and Stay, M. (2008) Most programs stop quickly or never halt. Advances in Applied Mathematics 40 295308.
Calude, C. and Stay, M. (2006) Natural halting probabilities, partial randomness, and zeta functions. Information and Computation 204 17181739.
Ebrahimi-Fard, K. and Manchon, D. (2007) The combinatorics of Bogolyubov's recursion in renormalization. (Available at arXiv0710.3675 [math-ph].)
Gács, P. and Levin, A. (1982) Causal nets or what is a deterministic computation? International Journal of Theoretical Physics 21 (12)961971.
Grass, J. (1996) Reasoning about Computational Resource Allocation. An introduction to anytime algorithms. Posted on the XRDS (Crossroads) website.
Grass, J. and Zilberstein, S. (1995) Programming with anytime algorithms. In: Proceedings of the IJCAI-95 Workshop on Anytime Algorithms and Deliberation Scheduling.
Heller, A. (1990) An existence theorem for recursive categories. Journal of Symbolic Logic 55 (3)12521268.
Levin, L. (1976) Various measures of complexity for finite objects (axiomatic description). Soviet Math. Dokl. 17 (2)522526.
Li, M. and Vitányi, P. (1993) An Introduction to Kolmogorov Complexity and its Applications, Springer.
Manin, Y. (2010) A Course in Mathematical Logic (the second, expanded Edition), Springer-Verlag.
Manin, Y. (1999) Classical computing, quantum computing, and Shor's factoring algorithm. Séminaire Bourbaki, Exposée 862 (June 1999), Astérisque 266 375404. (Available at arXiv:quant-ph/9903008).
Manin, Y. (2012) Renormalization and computation I. Motivation and background. In: Loday, J-L. and Vallette, B. (eds.) Proceedings OPERADS 2009. Séminaires et Congrès 26, Société Mathématique de France 181223. (Preprint available at arXiv:0904.492.)
Nabutovsky, A. and Weinberger, S. (2003) The fractal nature of Riem/Diff I. Geometriae Dedicata 101 145250.
Rogers, H. (1958) Gödel numberings of partial recursive functions. Journal of Symbolic Logic 23 331341.
Russell, S. J. and Zilberstein, S. (1991) Composing real–time systems. In: Mylopoulos, J. and Reiter, R. (eds.) Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, Australia, Morgan Kaufmann 212217.
Schnorr, C. P. (1974) Optimal enumerations and optimal Gödel numberings. Mathematical Systems Theory 8 (2)182191.
Soare, R. I. (2004) Computability theory and differential geometry. Bulletin of Symbolic Logic 10 (4)457486.
Yanofsky, N. S. (2006) Towards a definition of an algorithm. (Available at arXiv:math/0602053v3 [math.LO].)
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 30 *
Loading metrics...

Abstract views

Total abstract views: 171 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 20th March 2018. This data will be updated every 24 hours.