Small universal accepting hybrid networks of evolutionary processors
- 62 Downloads
In this paper, we improve some results regarding the size complexity of accepting hybrid networks of evolutionary processors (AHNEPs). We show that there are universal AHNEPs of size 6, by devising a method for simulating 2-tag systems. This result improves the best upper bound for the size of universal AHNEPs which was 7. We also propose a computationally and descriptionally efficient simulation of nondeterministic Turing machines with AHNEPs. More precisely, we prove that AHNEPs with ten nodes can simulate any nondeterministic Turing machine of time complexity f (n) in time O(f (n)). This result significantly improves the best known upper bound for the number of nodes in a network simulating in linear time an arbitrary Turing machine, namely 24.
KeywordsTuring Machine Input String Hybrid Network Communication Step Input Word
Unable to display preview. Download preview PDF.
- 4.Hillis W.D.: The Connection Machine. MIT, Cambridge (1985)Google Scholar
- 8.Minsky, M.L.: Size and structure of universal turing machines using tag systems. Recursive Function Theory, Symposium in Pure Mathematics, vol. 5, pp. 229–238 (1962)Google Scholar
- 12.Rozenberg, G., Salomaa, A. (eds): Handbook of Formal Languages, vol. I–III. Springer, Berlin (1997)Google Scholar
- 14.Woods, D., Neary, T.:On the time complexity of 2-tag systems and small universal Turing machines. 47th Annual IEEE symposium on foundations of computer science FOCS ’06, pp. 439–448 (2006)Google Scholar