PaoliniPiccoloRoversiENTCS2016 (Article)

Author(s)  Luca Paolini, Mauro Piccolo and Luca Roversi 
Title  « A Class of Reversible Primitive Recursive Functions » 
Journal  Electronic Notes in Theoretical Computer Science 
Volume  322 
Number  18605 
Page(s)  227242 
Year  2016 
URL  http://dx.doi.org/10.1016/j.entcs.2016.03.016 
Abstract 
Reversible computing is bideterministic which means that its execution is both forward and backward deterministic, i.e. next/previous computational step is uniquely determined. Various approaches exist to catch its extensional or intensional aspects and properties. We present a class RPRF of reversible functions which holds at bay intensional aspects and emphasizes the extensional side of the reversible computation by following the style of DedekindRobinson Primitive Recursive Functions. The class RPRF is closed by inversion, can only express bijections on integers  not only natural numbers , and it is expressive enough to simulate Primitive Recursive Functions, of course, in an effective way. 
@article{PaoliniPiccoloRoversiENTCS2016,
number = {18605},
volume = {322},
author = {Paolini, Luca and Piccolo, Mauro and Roversi, Luca},
url = {http://dx.doi.org/10.1016/j.entcs.2016.03.016},
title = {A Class of Reversible Primitive Recursive Functions},
abstract = {Reversible computing is bideterministic which means that its
execution is both forward and backward deterministic, i.e.
next/previous computational step is uniquely determined. Various
approaches exist to catch its extensional or intensional aspects
and properties. We present a class RPRF of reversible functions
which holds at bay intensional aspects and emphasizes the
extensional side of the reversible computation by following the
style of DedekindRobinson Primitive Recursive Functions. The
class RPRF is closed by inversion, can only express bijections on
integers  not only natural numbers , and it is expressive
enough to simulate Primitive Recursive Functions, of course, in an
effective way.},
pages = {227242},
journal = {Electronic Notes in Theoretical Computer Science},
doi = {10.1016/j.entcs.2016.03.016},
year = {2016},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)