Name
Abstract | ||
|---|---|---|
This article aims at providing signal machines as small as possible able to perform any computation (in the classical understanding) After presenting signal machines, it is shown how to get universal ones from Turing machines, cellular-automata and cyclic tag systems. Finally a halting universal signal machine with 13 meta-signals and 21 collision rules is presented. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.4204/EPTCS.1.7 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Keywords | Field | DocType |
automata theory,cellular automata,turing machine,formal language,computational complexity | Turing completeness,Universal Turing machine,NSPACE,Computer science,Algorithm,Super-recursive algorithm,Theoretical computer science,Description number,Turing machine,Turing machine examples,Time hierarchy theorem | Journal |
Volume | Issue | ISSN |
1 | 1 | 2075-2180 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jérôme Durand-Lose | 1 | 127 | 14.93 |