• Publications
  • Influence
Asymptotically almost all \lambda-terms are strongly normalizing
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 thatExpand
  • 34
  • 5
Intrinsic universality in tile self-assembly requires cooperation
TLDR
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
  • 71
  • 3
  • PDF
Some properties of random lambda terms
TLDR
We show various (syntactic and behavioral) properties of random lambda-terms. Expand
  • 15
  • 2
  • PDF
Directional dynamics along arbitrary curves in cellular automata
TLDR
This paper studies directional dynamics on one-dimensional cellular automata, a formalism previously introduced by the third author. Expand
  • 13
  • 2
  • PDF
Bulking II: Classifications of cellular automata
TLDR
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
  • 41
  • 1
  • PDF
Bulking I: An abstract theory of bulking
TLDR
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
  • 34
  • 1
Communication complexity and intrinsic universality in cellular automata
TLDR
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
  • 25
  • 1
  • PDF
Cellular automata and communication complexity
TLDR
The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. Expand
  • 24
  • 1
  • PDF
ASYMPTOTICALLY ALMOST ALL λ-TERMS ARE STRONGLY NORMALIZING
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 thatExpand
  • 21
  • 1
  • PDF
How Common Can Be Universality for Cellular Automata?
TLDR
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
  • 17
  • 1
  • PDF