A universal cellular automaton in quasi-linear time and its S-m-n form (Q1314380)

From MaRDI portal
Revision as of 17:55, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A universal cellular automaton in quasi-linear time and its S-m-n form
scientific article

    Statements

    A universal cellular automaton in quasi-linear time and its S-m-n form (English)
    0 references
    0 references
    29 November 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Turing machine
    0 references
    quasi-linear time universal cellular automaton
    0 references
    programming language
    0 references
    brick language
    0 references
    recursive specifications
    0 references
    transition functions
    0 references
    acceptable programming system
    0 references
    parallel computation
    0 references
    S-m-n theorem
    0 references
    structural complexity
    0 references