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

CRUDE

JC-Netssemantics for a Turing complete fragment of the join calculus. Thus a new formal model for concurrency and distributed systems is introduced.This new formal model simplifies Milner’s π-nets, while preserving their expressive power.

Precursor

P Systems with Membrane Creation: Universality and Efficiencyly universal. In this paper, we propose a new variant of Psystems, ., in which some objects are productive and create membranes. This new variant of Psystems is capable of solving the Hamiltonian Path Problem in linear time. We show that Psystems with membrane creation are computationally complete.

Dawdle

omnibus

Maurice Margenstern,Yurii RogozhinIncludes supplementary material:

Asparagus

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/620814.jpg

外向者

Arable

Machines, Computations, and Universality978-3-540-45132-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

人類的發(fā)源

A Simple Universal Logic Element and Cellular Automata for Reversible Computingachine can be realized as a circuit composed only of them. Such reversible circuits work in a very different fashion from conventional ones. We also discuss a simple reversible cellular automaton in which a rotary element can be implemented.