Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

TCS
2011

favoriteEmaildiscussreport

149views Theoretical Computer Science» more TCS 2011»

Four states are enough!

12 years 11 months ago

Four states are enough!

Download hal.archives-ouvertes.fr

This paper presents a 1D intrinsically universal cellular automaton with four states for a ﬁrst neighbors neighborhood, improving on the previous lower bound and getting nearer to the Turing universality bound. Intrinsic universality is discussed. Construction and proof rely on a combination of bulking techniques with programming using particles and collisions. Key words: Cellular automata, intrinsic universality, bulking, particles and collisions

Nicolas Ollinger, Gaétan Richard

Real-time Traffic

Intrinsic Universality | TCS 2011 | Theoretical Computer Science | Universal Cellular Automaton | ﬁrst Neighbors Neighborhood |

claim paper

Related Content

» Soft Error Tolerant Asynchronous Circuits Based on Dual Redundant Four State Logic

» Caching with Good Enough Currency Consistency and Completeness

» One is not enough multiple views in a media space

» The World Is Not Enough Another Look on SecondOrder DPA

» How Thorough Is Thorough Enough

» Just enough tabling

» Just enough learning of association rules the TAR2 Treatment learner

» Are a Few Neighboring Peers Good Enough

» Four issues concerning the semantics of Message Flow Graphs

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TCS
Authors	Nicolas Ollinger, Gaétan Richard

Comments (0)