Generation of invertible functions

DOI10.1016/0304-3975(89)90155-2zbMath0677.68061OpenAlexW1989873083MaRDI QIDQ1123625

G. Jacopini, Patrizia Mentrasti

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90155-2

zbMATH Keywords

functional iterationinvertible one-variable partial recursive functionsreversible iteration

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean} ⋮ A class of recursive permutations which is primitive recursive complete ⋮ A class of reversible primitive recursive functions ⋮ Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}

Cites Work

• Computation and construction universality of reversible cellular automata
• Primitive Recursive Functions. II
• A Note on Primitive Recursive Functions
• Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
• Flow diagrams, turing machines and languages with only two formation rules
• Logical Reversibility of Computation
• Computability of Recursive Functions
• General Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generation of invertible functions