Machines, Computations, and Universality Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings /

Machines, Computations, and Universality Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings /

In the ?rst part of the present volume of LNCS, the reader will ?nd the invited talks given at the MCU 2001 conference. In the second part, he/she will ?nd the contributions that were presented at the conference after selection. In both cases, papers are arranged in the alphabetical order of the aut...

Full description

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Margenstern, Maurice (Editor, http://id.loc.gov/vocabulary/relators/edt), Rogozhin, Yurii (Editor, http://id.loc.gov/vocabulary/relators/edt)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
Edition:1st ed. 2001.
Series:Lecture Notes in Computer Science, 2055
Subjects:
Computers.
Algorithms.
Computer logic.
Mathematical logic.
Theory of Computation.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Online Access:Full Text via HEAL-Link
Table of Contents:
  • Invited Lectures Notes
  • Three Small Universal Turing Machines
  • Computation in Gene Networks
  • Power, Puzzles and Properties of Entanglement
  • Combinatorial and Computational Problems on Finite Sets of Words
  • Computing with Membranes (P Systems): Universality Results
  • A Simple Universal Logic Element and Cellular Automata for Reversible Computing
  • Some Applications of the Decidability of DPDA's Equivalence
  • The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
  • Two Normal Forms for Rewriting P Systems
  • Technical Contributions
  • On a Conjecture of K?rka. A Turing Machine with No Periodic Configurations
  • On the Transition Graphs of Turing Machines
  • JC-Nets
  • JC-Nets
  • Nonterminal Complexity of Programmed Grammars
  • Nonterminal Complexity of Programmed Grammars
  • On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
  • On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
  • A Direct Construction of a Universal Extended H System
  • A Direct Construction of a Universal Extended H System
  • Speeding-Up Cellular Automata by Alternations
  • Speeding-Up Cellular Automata by Alternations
  • Efficient Universal Pushdown Cellular Automata and Their Application to Complexity
  • Efficient Universal Pushdown Cellular Automata and Their Application to Complexity
  • Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints
  • Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints
  • P Systems with Membrane Creation: Universality and Efficiency
  • P Systems with Membrane Creation: Universality and Efficiency
  • On the Computational Power of a Continuous-space Optical Model of Computation
  • On the Computational Power of a Continuous-space Optical Model of Computation
  • On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)
  • On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)
  • D0L System + Watson-Crick Complementarity = Universal Computation
  • D0L System + Watson-Crick Complementarity = Universal Computation.

Similar Items