Titlebook: Machines, Computations, and Universality; Third International Maurice Margenstern,Yurii Rogozhin Conference proceedings 2001 Springer-Verl

Hemoptysis

expeditious

蛤肉

Computing with Membranes (P Systems): Universality Resultsh symbol-objects and with string-objects; in the latter case, we consider systems based on rewriting, splicing, as well as rewriting together with other operations (replication, crossingover), with sets or with multisets of strings. Besides recalling characterizations of recursively enumerable langu

Fsh238

A Simple Universal Logic Element and Cellular Automata for Reversible Computingices based on microscopic physical law in the near future. In this paper, we focus on a problem how universal computers can be built from primitive elements with very simple reversible rules. We introduce a new reversible logic element called a “rotary element”, and show that any reversible Turing m

Mangle

The Equivalence Problem for Computational Models: Decidable and Undecidable Casesthe most-used models of computer programs, give a brief overview of the attempts to refine the boarder between decidable and undecidable cases of the equivalence problem for these models, and discuss the techniques for proving the decidability of the equivalence problem.

MIME

Two Normal Forms for Rewriting P Systems we consider Rewriting P Systems which use electrical charges to move objects between the membranes. We show that electrical charges, a feature introduced in order to obtain more “realistic” systems, induces simple systems: we define two normal forms for two variants of Rewriting P Systems which mak

CRACK

On a Conjecture of K?rka. A Turing Machine with No Periodic ConfigurationsTuring machine — when seen as a dynamical system on the space of its configurations — has at least one periodic orbit. In this paper, we provide an explicit counter-example to this conjecture. We also consider counter machines and prove that, in this case, the problem of determining if a given machi

Brocas-Area

貞潔

Observe