Sciweavers

1209 search results - page 27 / 242
» Universal Algebra and Computer Science
Sort
View
FOCS
2006
IEEE
14 years 2 months ago
On the time complexity of 2-tag systems and small universal Turing machines
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
Damien Woods, Turlough Neary
STACS
2005
Springer
14 years 2 months ago
How Common Can Be Universality for Cellular Automata?
Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellul...
Guillaume Theyssier
GI
2007
Springer
14 years 2 months ago
CAMPUS NEWS - an Information Network for Pervasive Universities
Abstract: In this paper we describe a network for distributing personalized Information within a pervasive University. We discuss the system architecture of our Bluetoothbased Camp...
Ulrich Furbach, Markus Maron, Kevin Read
STACS
1995
Springer
14 years 5 days ago
The Number of Views of Piecewise-Smooth Algebraic Objects
Abstract. A solid object in 3-dimensional space may be described by a collection of all its topologically distinct 2-dimensional appearances, its aspect graph. In this paper, we st...
Sylvain Petitjean
STACS
1997
Springer
14 years 24 days ago
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
Abstract. This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the de nitions of ca and of the Block (bca) and Partitioned (pca) s...
Jérôme Olivier Durand-Lose