Renormalization and Computation II: Time Cut-Off and the Halting Problem

Show simple item record Manin, Y.I. en 2012-01-16T03:19:41Z en 2012-01-16T03:19:41Z en 2010 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-377 (2010) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri en
dc.description.abstract This is the second installment to the project initiated in [Ma3]. In the first Part, I argued that both philosophy and technique of the perturbative renormalization in quantum field theory could be meaningfully transplanted to the theory of computation, and sketched several contexts supporting this view. In this second part, I address some of the issues raised in [Ma3] and provide their development in three contexts: a categorification of the algorithmic computations; time cut–off and Anytime Algorithms; and finally, a Hopf algebra renormalization of the Halting Problem. en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series en
dc.rights.uri en
dc.source.uri en
dc.title Renormalization and Computation II: Time Cut-Off and the Halting Problem en
dc.type Technical Report en
dc.subject.marsden Fields of Research::280000 Information, Computing and Communication Sciences en
dc.rights.holder The author(s) en
dc.rights.accessrights en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace