We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
We present a direct universal P system based on splicing. Our approach differs from those shown in previous papers as the P system we construct takes as input an encoding of anothe...
Pierluigi Frisco, Hendrik Jan Hoogeboom, Paul Sant
In my Research Analyst capacity at the University of California Davis School of Education until November 2003, I performed a web-based research study of Instructional Systems IS a...
This paper describes the development of Information System (IS) at Masaryk University in Brno. It supports full range of administrative and information functions in the study area,...
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj,...