A new function algebra of EXPTIME functions by safe nested recursion

Simple item page
dc.creatorArai, Toshiyasu
dc.creatorEguchi, Naohi
dc.date2006-07-27
dc.date2008-03-05
dc.date.accessioned2026-07-07T09:24:46Z
dc.date.available2026-07-07T09:24:46Z
dc.descriptionBellantoni and Cook have given a function-algebra characterization of the polynomial-time computable functions via an unbounded recursion scheme which is called safe recursion. Inspired by their work, we characterize the exponential-time computable functions with the use of a safe variant of nested recursion.
dc.identifierhttps://arxiv.org/abs/cs/0607118
dc.identifierhttp://arxiv.org/abs/cs/0607118
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156180
dc.subjectComputational Complexity
dc.subjectF.4.1; F.1.1; F.1.3
dc.titleA new function algebra of EXPTIME functions by safe nested recursion
dc.typetext

Files

Collections

arXiv