What Could be Computed by DNA Strands?

Date: 
Friday, March 2, 2007 - 4:58pm


Maurice Margenstern
Head, Department of Computer Science
University of Metz
Date: Wednesday, March 7, 2007
Time: 3:00pm-4:00pm
Location: ESB 2001)

Abstract:

After Adleman’s experiment which we shall shortly recall, a lot of models and
paradigms for computing with DNA strands where proposed. We shall look
at a few of them: test tubes, splicing systems, time-varying splicing systems. We
shall also look at P systems, a new family introduced by Gheorghe Paun in
1999 and, in the large family of such systems, we shall focus on P systems with
splicing rules and P systems with symport/antiport rules. In each system, we
shall mainly look at those which are universal.

Biography:

Maurice Margenstern received his PhD degree in Mathematics from the
University Paris 11 (Orsay) and his habilitation degree from the University
Paris 7 in Theoretical Computer Science. He joined the University of Metz as
Professor of Computer Science in 1995, where he is presently the Head of the
Computer Science Department. His research interests include the theory of
computation, models of DNA computations and P systems, models of
cellular computation, cellular automata.

Host: Oscar Ibarra