= = = = Apologies for multiple postings = = = = = PARTICIPATION POSTER OPEN SESSION ---------------------------------------------------------------------- International Conference M M CCC U U 22222 00000 00000 7777777 MM MM C C U U 2 2 0 0 0 0 7 M M M M C U U 2 2 0 0 0 0 7 M M M C U U 22 0 0 0 0 7 M M C U U 2 0 0 0 0 7 M M C C U U 22 0 0 0 0 77 M M CCC UUU 2222222 00000 00000 77 MACHINES, COMPUTATIONS AND UNIVERSALITY ORLEANS, FRANCE SEPTEMBER, 10-13, 2007 http://www.univ-orleans.fr/lifo/Manifestations/MCU07/ ----------------------------------------------------------------------- MCU takes place every 3 years since 1995. Its proceedings are in Springer's LNCS (from 2001). From the beginning they gave rise to special issues of first TCS then Fundamenta Informaticae. ----------------------------------------------------------------------- TOPICS: Digital computation (fundamental classical models): Turing machines, register machines, word processing (groups and monoids), other machines. Digital models of computation: cellular automata, other automata, tiling of the plane, polyominoes, snakes, neural networks, molecular computations, Analog and Hybrid Computations: BSS machines, infinite cellular automata, real machines, quantum computing In all these settings: frontiers between a decidable halting problem and an undecidable one in the various computational settings minimal universal codes: size of such a code, namely, for Turing machines, register machines, cellular automata, tilings, neural nets, Post systems, ... computation complexity of machines with a decidable halting problem as well as universal machines, connections between decidability under some complexity class and completeness according to this class, self-reproduction and other tasks, universality and decidability in the real field PROGRAM COMMITTEE: Erzsebet CSUHAJ-VARJU, Hungarian Academy of Sciences, Hungary Jerome DURAND-LOSE, University of Orleans, France, co-chair Angsheng LI, Institute of Software, Chinese Academy of Sciences, Beijing, China Maurice MARGENSTERN, LITA, University of Metz, France, co-chair Jean-Yves MARION, LORIA, Ecole des Mines de Nancy, France Gheorghe PAUN, Romanian Academy, Bucharest, Romania Yurii ROGOZHIN, Institute of Mathematics, Chisinau, Moldova Grzegorz ROZENBERG, University of Leiden, The Netherlands Jiri WIEDERMANN, Academy of Science, Czech Republic Damien WOODS, University College, Cork, Ireland INVITED SPEAKERS: Andrew ADAMATZKY, University of Bristol, UK Encapsulating Reaction-diffusion Computers Olivier BOURNEZ, LORIA, INRIA-Lorraine, France On the Computational Capabilities of Several Models Mark BURGIN, UCLA, Los Angeles, USA Universality, Reducibility, and Completeness Manuel CAMPAGNOLO, Lisbon University of Technology, Portugal Using Approximation to Relate Computational Classes over the Reals Joel David HAMKINS, CUNY, New-York, USA A Survey of Infinite Time Turing Machines Jarkko KARI, University of Turku, Finland The Tiling Problem Revisited Pascal KOIRAN, Ecole Normale Superieure de Lyon, France Decision versus Evaluation in Algebraic Complexity Kenichi MORITA, University of Hiroshima, Japan A Universal Reversible Turing Machine KG SUBRAMANIAN, Christian College of Chennai, India P Systems and Picture Languages Klaus SUTNER, Carnegie Mellon University, Pittsburgh, USA Information Hiding and Incompleteness POSTER / OPEN SESSION: We are planning to have a poster session and/or an open session. If you are interested in presenting some work in either form please contact one the PC chairs before July 31st at jerome.durand-lose@univ-orleans.fr margens@univ-metz.fr REGISTRATION: Registration is open on the web site: http://www.univ-orleans.fr/lifo/Manifestations/MCU07/ Category | Early registration | Late (after July, the 31st, 2007) ----------+--------------------+---------------------------------- Full | 300 | 350 Student | 200 | 250 ACCEPTED PAPERS: Artiom ALHAZOV, Rudolf FREUND, Marion OSWALD, Sergey VERLAN Partial Halting in P Systems Using Membrane Rules with Permitting Contexts Artiom ALHAZOV, Mario de Jesus PEREZ-JIMENEZ Uniform Solution of QSAT using Polarizationless Active Membranes Dorothea BAUMEISTER, Jorg ROTHE Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem Tommaso BOLOGNESI Planar trivalent network computation Jurgen DASSOW, Bianca TRUTHE On the Power of Networks of Evolutionary Processors Liesbeth De MOL Study of Limits of Solvability in Tag Systems John FISHER, Marc BEZEM Query Completeness of Skolem Machine Computations Hermann GRUBER, Markus HOLZER, Martin KUTRIB More on the Size of Higman-Haines Sets: Effective Constructions Artiom MATVEEVICI, Yurii ROGOZHIN, Sergey VERLAN Insertion-Deletion Systems with One-Sided Contexts Victor MITRANA, Juan CASTELLANOS, Florin MANEA, Luis Fernando MINGO LOPEZ Accepting Networks of Splicing Processors With Filtered Connections Frantisek MRAZ, Martin PLATEK, Friedrich OTTO Hierarchical relaxations of the correctness preserving property for restarting automata Turlough NEARY, Damien WOODS Four small universal Turing machines Hidenosuke NISHIO Changing the Neighborhood of Cellular Automata Alexander OKHOTIN A simple P-complete problem and its representations by language equations Olivier TEYTAUD Slightly beyond Turing's computability for studying genetic programming Hiroshi UMEO A Smallest Five-State Solution to the Firing Squad Synchronization Problem Damien WOODS, Turlough NEARY Small semi-weakly universal Turing machines Jean-Baptiste YUNES Simple New Algorithms which solve the Firing Squad Synchronization Problem: a 7-states 4n-steps solution