Turing-completeness of additive transformations in the ETS formalism 1

@inproceedings{Golubitsky2004TuringcompletenessOA,
  title={Turing-completeness of additive transformations in the ETS formalism 1},
  author={Oleg Golubitsky},
  year={2004}
}
We represent strings over a finite alphabet by the data structures, called string structs, introduced in the evolving transformation system (ETS) model, which was proposed as a general model for structural object representation and classification and has been formalized recently. Then we describe string languages as classes of structs generated by a finite… CONTINUE READING