Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Universality of Tag Systems with P = 2
Journal of the ACM (JACM)
Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
DNA computing based on splicing: universality results
Theoretical Computer Science - Special issue on universal machines and computations
Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages
Where mathematics, computer science, linguistics and biology meet
DNA Computing: Distributed Splicing Systems
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
About Time-Varying Distributed H Systems
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Computation: finite and infinite machines
Computation: finite and infinite machines
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Time-Varying Distributed H Systems: An Overview
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Computing beyond the turing limit using the h systems
DNA'04 Proceedings of the 10th international conference on DNA computing
Time-Varying Distributed H Systems: An Overview
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Turing computability and membrane computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 0.00 |
Time-varying distributed H systems (TVDH systems shortly) of degree n are a well known model of splicing computations which has the following special feature: at different moments one uses different sets of splicing rules (the number of these sets of splicing rules is called the degree of the TVDH system). It is known that there is a universal TVDH system of degree 2. Now we prove that there is a universal TVDH system of degree 1. It is a surprising result because we did not thought that these systems are so powerful.Recently both authors proved that TVDH systems of degree 1 can generate any recursively enumerable languages. We present here the short description of the main idea of the proof that result.