Pages that link to "Item:Q303695"
From MaRDI portal
The following pages link to On reversible Turing machines and their function universality (Q303695):
Displaying 10 items.
- Simulating reversible computation with reaction systems (Q1982972) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
- An instruction set for reversible Turing machines (Q2041688) (← links)
- Reversible computing from a programming language perspective (Q2693633) (← links)
- (Q2965498) (← links)
- (Q4857721) (← links)
- (Q5089270) (← links)
- Universality of Wolfram’s 2, 3 Turing Machine (Q5126861) (← links)
- Logical Approaches to Computational Barriers (Q5898814) (← links)