5 citations · 6 across the 7 of their papers we have counts for
8 papers
Deterministic Non-cooperative Binding in Two-Dimensional Tile Assembly Systems Must Have Ultimately Periodic Paths
Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Nataša Jonoska
We consider non-cooperative binding, so-called 'temperature 1', in deterministic or directed (called here confluent) tile self-assembly systems in two dimensions and show a necessa…
Abstract Geometrical Computation 11: Slanted Firing Squad Synchronisation on Signal Machines
Jérôme Durand-Lose, Aurélien Emmanuel
Firing Squad Synchronisation on Cellular Automata is the dynamical synchronisation of finitely many cells without any prior knowledge of their range. This can be conceived as a sig…
Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute
Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Nataša Jonoska
We consider non cooperative binding in so called `temperature 1', in deterministic (here called {\it confluent}) tile self-assembly systems (1-TAS) and prove the standing conjectur…
Self-Assembly of 3-D Structures Using 2-D Folding Tiles
Jerome Durand-Lose, Jacob Hendricks, Matthew J. Patitz +2
Self-assembly is a process which is ubiquitous in natural, especially biological systems. It occurs when groups of relatively simple components spontaneously combine to form more c…
Abstract Geometrical Computation 10: An Intrinsically Universal Family of Signal Machines
Florent Becker, Tom Besson, Jérôme Durand-Lose +4
Signal machines form an abstract and idealised model of collision computing. Based on dimensionless signals moving on the real line, they model particle/signal dynamics in Cellular…
Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality
Florent Becker, Mathieu Chapelle, Jérôme Durand-Lose +2
In the context of abstract geometrical computation, computing with colored line segments, we study the possibility of having an accumulation with small signal machines, ie, signal…
Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
Denys Duchier, Jérôme Durand-Lose, Maxime Senot
Abstract geometrical computation can solve hard combinatorial problems efficiently: we showed previously how Q-SAT can be solved in bounded space and time using instance-specific s…
Small Turing universal signal machines
Jérôme Durand-Lose
This article aims at providing signal machines as small as possible able to perform any computation (in the classical understanding). After presenting signal machines, it is shown…