Theoretical Computer Science

27

click to vote

TCS
2011

157views Theoretical Computer Science» more TCS 2011»

Last cases of Dejean's conjecture

13 years 6 months ago

Download www.mccme.ru

Michaël Rao

claim paper

Read More »

41

click to vote

TCS
2011

180views Theoretical Computer Science» more TCS 2011»

Computational processes, observers and Turing incompleteness

13 years 6 months ago

Download www-2.cs.cmu.edu

We propose a formal deﬁnition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...

Klaus Sutner

claim paper

Read More »

37

click to vote

TCS
2011

149views Theoretical Computer Science» more TCS 2011»

Four states are enough!

13 years 6 months ago

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 ...

Nicolas Ollinger, Gaétan Richard

claim paper

Read More »

41

click to vote

TCS
2011

183views Theoretical Computer Science» more TCS 2011»

Communication complexity and intrinsic universality in cellular automata

13 years 6 months ago

Download www.dim.uchile.cl

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...

Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...

claim paper

Read More »

34

click to vote

TCS
2011

166views Theoretical Computer Science» more TCS 2011»

Limitations of self-assembly at temperature 1

13 years 6 months ago

Download www.cs.iastate.edu

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 ...

David Doty, Matthew J. Patitz, Scott M. Summers

claim paper

Read More »

30

click to vote

TCS
2011

139views Theoretical Computer Science» more TCS 2011»

P systems with minimal insertion and deletion

13 years 6 months ago

Download www.gcn.us.es

Artiom Alhazov, Alexander Krassovitskiy, Yurii Rog...

claim paper

Read More »

34

click to vote

TCS
2011

131views Theoretical Computer Science» more TCS 2011»

The three column Bandpass problem is solvable in linear time

13 years 6 months ago

Download webdocs.cs.ualberta.ca

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 ...

Zhong Li, Guohui Lin

claim paper

Read More »

19

click to vote

TCS
2011

134views Theoretical Computer Science» more TCS 2011»

On the complex behavior of simple tag systems - An experimental approach

13 years 6 months ago

Download logica.ugent.be

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...

Liesbeth De Mol

claim paper

Read More »

44

click to vote

DBSK
2011

205views Theoretical Computer Science» more DBSK 2011»

Projektseminar "Similarity Search Algorithms"

13 years 6 months ago

Download www.hpi.uni-potsdam.de

Dustin Lange, Tobias Vogel, Uwe Draisbach, Felix N...

claim paper