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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5925520 / rank
 
Normal rank
Property / zbMATH Keywords
 
reversible computing
Property / zbMATH Keywords: reversible computing / rank
 
Normal rank
Property / zbMATH Keywords
 
reversible cellular automaton
Property / zbMATH Keywords: reversible cellular automaton / rank
 
Normal rank
Property / zbMATH Keywords
 
universal cellular automaton
Property / zbMATH Keywords: universal cellular automaton / rank
 
Normal rank
Property / zbMATH Keywords
 
reversible Turing machine
Property / zbMATH Keywords: reversible Turing machine / rank
 
Normal rank
Property / zbMATH Keywords
 
cyclic tag system
Property / zbMATH Keywords: cyclic tag system / rank
 
Normal rank

Revision as of 13:18, 1 July 2023

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
    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