We present a quantitative analysis of various (syntactic and behavioral) prop- erties of random �-terms. Our main results show that asymptotically, almost all terms are strongly normalizing and that… Expand

We prove a negative result on the power of a model of algorithmic self-assembly for which finding general techniques and results has been notoriously difficult.Expand

This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling.Expand

This paper is the first part of a series of two papers dealing with bulking: a quasi-order on cellular automata comparing space-time diagrams up to some rescaling and an axiomatization of bulking.Expand

We introduce necessary conditions for a cellular automaton to be ''universal'', according to a precise notion of simulation, related both to the dynamics of cellular automata and to their computational power.Expand

We present a quantitative analysis of various (syntactic and behavioral) properties of random λ-terms. Our main results show that asymptotically, almost all terms are strongly normalizing and that… Expand

We address the problem of the density of intrinsically universal cellular automata among cellular automa or a subclass of cellular automaton and show that the density is undecidable.Expand