A universal cellular automaton in quasi-linear time and its S-m-n form (Q1314380): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:59, 31 January 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
29 November 1994
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
