• DOI:10.1007/s00354-018-0039-1
Corpus ID: 52047090

On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions

@article{Paolini2018OnAC,
  title={On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions},
  author={Luca Paolini and M. Piccolo and L. Roversi},
  journal={New Generation Computing},
  year={2018},
  volume={36},
  pages={233-256}
}

• Luca Paolini, M. Piccolo, L. Roversi
• Published 2018
• Computer Science
• New Generation Computing

Reversible computing is both forward and backward deterministic. This means that a uniquely determined step exists from the previous computational configuration (backward determinism) to the next one (forward determinism) and vice versa. We present the reversible primitive recursive functions (RPRF), a class of reversible (endo-)functions over natural numbers which allows to capture interesting extensional aspects of reversible computation in a formalism quite close to that of classical… Expand

View on Springer

wikidata.org

Save to Library

Create Alert

Cite

Launch Research Feed