How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? (Q5162597)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7419480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? |
scientific article; zbMATH DE number 7419480 |
Statements
How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? (English)
0 references
3 November 2021
0 references
reversible cellular automaton
0 references
elementary triangular partitioned cellular automaton
0 references
reversible Turing machine
0 references
reversible logic element with memory
0 references
0 references
0 references
0 references
