Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata (Q549699): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5615059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5321501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four states are enough! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation and construction universality of reversible cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computation-universal two-dimensional 8-state triangular reversible cellular automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible computing and cellular automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5446408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphisms and automorphisms of the shift dynamical system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tesselations with local transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversibility and surjectivity problems of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Universal Reversible Turing Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation-universality of one-dimensional one-way reversible cellular automata / rank
 
Normal rank

Latest revision as of 07:46, 4 July 2024

scientific article
Language Label Description Also known as
English
Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
scientific article

    Statements

    Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata (English)
    0 references
    0 references
    18 July 2011
    0 references
    reversible computing
    0 references
    reversible cellular automaton
    0 references
    universal cellular automaton
    0 references
    reversible Turing machine
    0 references
    cyclic tag system
    0 references

    Identifiers