RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
Main page
About this project
Software
Classifications
Links
Terms of Use

Search papers
Search references

RSS
Current issues
Archive issues
What is RSS






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Math. Structures Comput. Sci., 2012, Volume 22, Issue 5, Pages 729–751 (Mi mscs1)  

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

Yu. I. Maninab

a Max Planck Institut für Mathematik, Bonn, Germany
b Northwestern University, Evanston, U.S.A.

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.

DOI: https://doi.org/10.1017/S0960129511000508


Bibliographic databases:

Document Type: Article
Language: English

Linking options:
  • http://mi.mathnet.ru/eng/mscs1

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Number of views:
    This page:8

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019