On the computational power of totalistic cellular automata (Q3763596): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Dan Gordon / rank
Normal rank
 
Property / author
 
Property / author: Dan Gordon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4062662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and computational complexity of systolic trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Open Problems in the Theory of Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4746787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Computation-Universal Cellular Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of cellular automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:42, 18 June 2024

scientific article
Language Label Description Also known as
English
On the computational power of totalistic cellular automata
scientific article

    Statements

    On the computational power of totalistic cellular automata (English)
    0 references
    0 references
    1987
    0 references
    0 references
    Totalistic cellular automata
    0 references
    Turing machine
    0 references
    computation-universal
    0 references
    0 references