The fixed point problem of a simple reversible language

DOI10.1016/j.tcs.2019.10.005zbMath1433.68079OpenAlexW2979747422WikidataQ127121292 ScholiaQ127121292MaRDI QIDQ1989327

Luca Paolini, Armando B. Matos, Luca Roversi

Publication date: 21 April 2020

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

Full work available at URL: http://hdl.handle.net/2318/1734164

zbMATH Keywords

fixed pointsdecidabilityreversible computing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other nonclassical models of computation (68Q09)

Related Items (3)

Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean} ⋮ Splitting Recursion Schemes into Reversible and Classical Interacting Threads ⋮ Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}

Uses Software

• qPCF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On reversible Turing machines and their function universality
• Notes on Landauer's principle, reversible computation, and Maxwell's demon
• A class of reversible primitive recursive functions
• Remarks on blind and partially blind one-way multicounter machines
• Universality of a reversible two-counter machine
• Linear programs in a simple reversible language.
• Theory of reversible computing
• On the computational complexity of imperative programming languages
• Turing Computability
• $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations
• What Do Reversible Programs Compute?
• Reversible Computing
• Computability and Logic
• Undecidable diophantine equations
• A Certified Study of a Reversible Programming Language
• System NEL is Undecidable
• On the Number of Solutions of Diophantine Equations

This page was built for publication: The fixed point problem of a simple reversible language