Sciweavers

BIRTHDAY
2007
Springer

Linear Recursive Functions

13 years 9 months ago
Linear Recursive Functions
Abstract. With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is essential in order to obtain a Turingcomplete computation model. However, erasing and copying do not need to be explicitly included in Turing-complete computation models: in this paper we show that the class of partial recursive functions that are syntactically linear (that is, partial recursive functions where no argument is erased or copied) is Turing-complete.
Sandra Alves, Maribel Fernández, Már
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where BIRTHDAY
Authors Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie
Comments (0)