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

Manin, Y.I.

dc.contributor.author	Manin, Y.I.	en
dc.date.accessioned	2012-01-16T03:19:41Z	en
dc.date.available	2012-01-16T03:19:41Z	en
dc.date.issued	2010	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-377 (2010)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/10530	en
dc.description.abstract	This is the second installment to the project initiated in [Ma3]. In the ﬁrst Part, I argued that both philosophy and technique of the perturbative renormalization in quantum ﬁeld 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 categoriﬁcation of the algorithmic computations; time cut–oﬀ and Anytime Algorithms; and ﬁnally, 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	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	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	http://purl.org/eprint/accessRights/OpenAccess	en