scientific article; zbMATH DE number 7357506

MaRDI QIDQ4992865zbMATH OpenFDO

Authors Kenichi Morita

Publication date 10 June 2021

Full work available at URL https://arxiv.org/abs/1309.1264, http://eptcs.web.cse.unsw.edu.au/paper.cgi?MCU2013.3

Mathematics Subject Classification ID

Classical models of computation (Turing machines, etc.) (68Q04) Networks and circuits as models of computation; circuit complexity (68Q06) Other nonclassical models of computation (68Q09)

Recommendations

• Machines, Computations, and Universality
• scientific article; zbMATH DE number 2050943
• Constructing reversible Turing machines by reversible logic element with memory
• Novel Reversible Logic Elements for Unconventional Computing
• scientific article; zbMATH DE number 1526145
• r-Universal reversible logic gates
• scientific article; zbMATH DE number 1738656
• Multiple-valued reversible logic circuits
• On universality of general reversible multiple-valued logic gates
• Implementing an arbitrary reversible logic gate

Cited in

(10)

• How can we construct reversible machines out of reversible logic element with memory?
• scientific article; zbMATH DE number 2050943 (Why is no real title available?)
• scientific article; zbMATH DE number 1738656 (Why is no real title available?)
• Constructing reversible Turing machines by reversible logic element with memory
• scientific article; zbMATH DE number 6028108 (Why is no real title available?)
• Machines, Computations, and Universality
• Novel Reversible Logic Elements for Unconventional Computing
• Making reversible computing machines in a reversible cellular space
• The Morita gate is universal
• Reversible computing and cellular automata -- a survey

This page was built for publication:

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