Tag - cellular automata - Jean-Christophe Dubacq

中法虚拟机技术与云计算研讨会 (VMCC2010)

Wednesday 7 April 2010

I made a short trip (125h from my home and back again) to Wǔhàn and Běijīng (Wuhan et Beijing). Beyond my participation to a small (but featureful) workshop, (France-China Joint Workshop on Virtual Machines and Cloud Computing), the goal of the trip was to establish collaborations with the Grid team of HUST University (Huazhong University of Science and Technology) and the Computer Science lab of Tsinghua University in Beijing.

The workshop took place on Tuesday, 22nd of March 2010, even if we were very tired by the 20 and more hours of trip (of whom 13 of plane). Since Christophe already presented the results and prospectives on PaaS (Platform as a Service) that were the main hook between our team in Paris 13 and the Chinese labs, I did present a few results on methods for massive parallelism for cellular automata.

On Thursday, 24th of March, we met with the team in Tsinghua (one of the best universities in China) and Jean-Pierre Jouannaud, director of the LIAMA, to further inspect collaboration between us and chinese teams.

This trip could not have taken place without the support of Jacques Fleck, science attaché for the French Consulate in Wuhan, who supported us financially and provided advice and insight for the future of our collaboration with China.

The rest of this post shows some pictures of the trip.

Talk in Perpignan

Tuesday 19 May 2009

I went to Perpignan (Perpinyà en catalan) on the 18th of May to make a short talk at the PROMES laboratory.

Meeting "Programmation for Cellular Automata"

Monday 9 June 2008

Just a quick note (see the French translation for more details): I made a small talk at the "Programmation sur automates cellulaires" meeting organised by Jean-Baptiste Yunès. I mostly presented the same thing as my 1995 master talk, with

Participation à JAC 2008

Friday 25 April 2008

À l’occasion du départ à la retraite de mon directeur de thèse Jacques Mazoyer a été organisée une conférence très sérieuse sur les thématiques qui lui sont chères, liées en particulier aux automates cellulaires. De nombreux intervenants extérieurs étaient là (venant de France bien sûr, mais aussi de Finlande, de Russie, d’Italie, du Maroc et du Chili).

Je n’ai mis dans cet article que les photographies de la conférence proprement dites ainsi qu’une analyse personnelle de ce que j’ai appris sur le domaine des automates cellulaires en 2008. Les autres photos que j’ai faites sont sur ma page personnelle. L’article détaillé est sur une autre page.

Signals for Cellular Automata in Dimension 2 or Higher

Wednesday 9 January 2008

In this article, co-written with Véronique Terrier for the Latin 2002 conference, we investigate how increasing the dimension of the array can help to draw signals on cellular automata. We show the existence of a gap of constructible signals in any dimension. We exhibit two cellular automata in dimension 2 to show that increasing the dimension allows to reduce the number of states required for some constructions.

Kolmogorov complexity and cellular automata classification

Monday 7 January 2008

In this article, written jointly with Enrico Formenti and Bruno Durand, we present a new approach to cellular automata (CA) classification based on algorithmic complexity. We construct a parameter κ which is based only on the transition table of CA and measures the "randomness" of evolutions; κ is better, in a certain sense, than any other parameter recursively definable on CA tables. We investigate the relations between the classical topological approach and ours one. Our parameter is compared with Langton's λ parameter: κ turns out to be theoretically better and also agrees with some practical evidences reported in literature. Finally, we propose a protocol to approximate κ and make experiments on CA dynamical behavior.

How to simulate Turing Machines by invertible cellular automata

Saturday 5 January 2008

Abstract of the article

The issue of testing invertibility of cellular automata has been often discussed. The computation universality of cellular automata has long been positively resolved, and by showing that any cellular automaton could be simulated by an invertible one having a superior dimension, Toffoli proved that invertible cellular automaton of dimension d ≥2 were computation-universal. Kenichi Morita proved that any invertible Turing Machine could be simulated by a one-dimensional invertible cellular automaton, which proved computation-universality of invertible cellular automata. This article shows how to simulate any Turing Machine by an invertible cellular automaton with no loss of time and gives, as a corollary, an easier proof of this result.

Quick signals in higher dimensions

Friday 4 January 2008

Cellular automata have very different properties whether their dimension being 1 or 2 from the point of view of computability theory. After having defined a notion of signal, we analyse the intrinsic computational power of the cellular automata in dimension 1 or 2 according to the shape of the signals that can be generated with them.

Internship reports

Thursday 3 January 2008

While studying at École normale supérieure de Lyon, I did two internships in labs in my undergraduate years (one in 1993, one in 1994), the first one in the LIPlab and the second in the IIT Madras (when Chennai / சென்னை was still Madras).

Tag - cellular automata

Abstract of the article

Tags