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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3802629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 8-state minimal time solution to the firing squad synchronization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On real-time cellular automata and trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of Primes by a One-Dimensional Real-Time Iterative Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear speed-up theorem for cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time language recognition by one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Computation-Universal Cellular Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimum solution to the firing squad synchronization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675526 / rank
 
Normal rank

Latest revision as of 13:04, 22 May 2024

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