CRUDE 发表于 2025-4-1 05:14:59
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 发表于 2025-4-1 08:27:37
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 发表于 2025-4-1 10:45:17
http://reply.papertrans.cn/63/6209/620814/620814_63.pngomnibus 发表于 2025-4-1 15:13:04
Maurice Margenstern,Yurii RogozhinIncludes supplementary material:Asparagus 发表于 2025-4-1 19:53:01
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/620814.jpg外向者 发表于 2025-4-2 00:06:12
http://reply.papertrans.cn/63/6209/620814/620814_66.pngArable 发表于 2025-4-2 06:49:39
Machines, Computations, and Universality978-3-540-45132-7Series ISSN 0302-9743 Series E-ISSN 1611-3349人类的发源 发表于 2025-4-2 09:23:21
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.