The following pages link to (Q5389332):
Displaying 6 items.
- An instruction set for reversible Turing machines (Q2041688) (← links)
- How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory? (Q2944902) (← links)
- (Q5061520) (← links)
- How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? (Q5162597) (← links)
- Machines, Computations, and Universality (Q5710884) (← links)
- A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior (Q6191399) (← links)