Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Lower bounds to the complexity of symmetric Boolean functions
Theoretical Computer Science
On linear decision trees computing Boolean functions
Proceedings of the 18th international colloquium on Automata, languages and programming
Handbook of theoretical computer science (vol. A)
Monotone separation of logarithmic space from logarithmic depth
Journal of Computer and System Sciences
Communication complexity
The Quest for Small Universal Cellular Automata
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Inducing an Order on Cellular Automata by a Grouping Operation
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Cellular automata and communication complexity
Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Meanders, Ramsey theory and lower bounds for branching programs
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
A new upper bound for the bipartite Ramsey problem
Journal of Graph Theory
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Communication complexity and intrinsic universality in cellular automata
Theoretical Computer Science
Theoretical Computer Science
Communication complexity in number-conserving and monotone cellular automata
Theoretical Computer Science
Bulking II: Classifications of cellular automata
Theoretical Computer Science
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
How common can be universality for cellular automata?
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 5.23 |
In previous works we found necessary conditions for a cellular automaton (CA) in order to be intrinsically universal (a CA is said to be intrinsically universal if it can simulate any other). The idea was to introduce different canonical communication problems, all of them parameterized by a CA. The necessary condition was the following: if @J is an intrinsically universal CA then the communication complexity of all the canonical problems, when parameterized by @J, must be maximal. In this paper, instead of introducing a new canonical problem, we study the setting where they can all be used simultaneously. Roughly speaking, when Alice and Bob-the two parties of the communication complexity model-receive their inputs they may choose online which canonical problem to solve. We give results showing that such freedom makes this new problem, that we call Ovrl, a very strong filter for ruling out CAs from being intrinsically universal. More precisely, there are some CAs having high complexity in all the canonical problems but have much lower complexity in Ovrl.