Bicontinuous extensions of invertible combinatorial functions
From MaRDI portal
Publication:3924098
DOI10.1007/BF01752388zbMath0469.94020MaRDI QIDQ3924098
Publication date: 1981
Published in: Mathematical Systems Theory (Search for Journal in Brave)
diffeomorphic componentwise extensionphysical realizability of general computing mechanismsreversible primitives
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (21)
How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme ⋮ The complexity of the representation of multiple-output Boolean functions ⋮ How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory? ⋮ Representation of reversible cellular automata with block permutations ⋮ Realization and synthesis of reversible functions ⋮ Physics of selective systems: Computation and biology ⋮ Reversible computing and cellular automata -- a survey ⋮ Conservative logic ⋮ Minimal universal library for \(n\times n\) reversible circuits ⋮ Unnamed Item ⋮ On synthesis of 3 × 3 reversible logic functions ⋮ Models of quantum computation and quantum programming languages ⋮ WHAT IS QUANTUM COMPUTATION? ⋮ A DATA MODEL FOR THE MORPHOGENETIC NEURON ⋮ Information and computation: Classical and quantum aspects ⋮ The role of relative entropy in quantum information theory ⋮ Organization of computations on the atomic-molecular level ⋮ Quantum computation based on retarded and advanced propagation. ⋮ Realizable Universal Quantum Logic Gates ⋮ PhysComp96. Proceedings of the 4th workshop on physics and computation, Boston, MA, USA, November 22--24, 1996 ⋮ Invertible cellular automata: A review
Cites Work
- Unnamed Item
- Computation and construction universality of reversible cellular automata
- Irreversibility and Heat Generation in the Computing Process
- Feedback and generalized logic
- ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
- Infinite Systems of Classical Particles
- Logical Reversibility of Computation
This page was built for publication: Bicontinuous extensions of invertible combinatorial functions
