Systems based on the splicing operation are computationally complete. Usually demonstrations of this are based on simulations of type-0 grammars. We propose a different way to reach this result by solving Diophantine equations using extended H system with permitting context. Completeness then follows from Matiyasevich's theorem stating that the class of Diophantine sets is identical to the class of recursive enumerable sets.
展开▼