TCS
2011
14 years 10 months ago
2011
133
click to vote
TCS
2011
14 years 10 months ago
2011
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
138
click to vote
TCS
2011
14 years 10 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
145
click to vote
TCS
2011
14 years 10 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
131
click to vote
TCS
2011
14 years 10 months ago
2011
We prove that if a set X ⊆ Z2 weakly self-assembles at temperature 1 in a deterministic (Winfree) tile assembly system satisfying a natural condition known as pumpability, then ...
TCS
2011
14 years 10 months ago
2011
116
click to vote
TCS
2011
14 years 10 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
TCS
2011
14 years 10 months ago
2011
It is a well-know fact that apparently simple systems can give rise to complex behavior. But why exactly does a given system behave in a complex manner? There are two main approac...