Generation of invertible functions

DOI10.1016/0304-3975(89)90155-2MaRDI QIDQ1123625zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Invertible classes
• Theory and Applications of Models of Computation
• Impossibility of finite generation of partial recursive functions by a unary isotone operation
• scientific article; zbMATH DE number 2090028
• Automatic Partial Inversion of Inductively Sequential Functions

Cites work

• A Note on Primitive Recursive Functions
• Computability of Recursive Functions
• Computation and construction universality of reversible cellular automata
• Flow diagrams, turing machines and languages with only two formation rules
• General Recursive Functions
• scientific article; zbMATH DE number 3898250 (Why is no real title available?)
• scientific article; zbMATH DE number 3657799 (Why is no real title available?)
• scientific article; zbMATH DE number 3748411 (Why is no real title available?)
• scientific article; zbMATH DE number 3468276 (Why is no real title available?)
• scientific article; zbMATH DE number 3529827 (Why is no real title available?)
• scientific article; zbMATH DE number 3066801 (Why is no real title available?)
• Logical Reversibility of Computation
• Primitive Recursive Functions. II
• Reversible Turing Machines and Polynomial Time Reversibly Computable Functions

Cited in

(7)

• Inverting random functions
• A class of recursive permutations which is primitive recursive complete
• Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}
• Invertible classes
• Theory and Applications of Models of Computation
• Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean}
• A class of reversible primitive recursive functions

This page was built for publication: Generation of invertible functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123625)