[0907.5130v1] Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Formal Languages and Automata Theory

arXiv:0907.5130v1 (cs)
[Submitted on 29 Jul 2009]

Title:Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections

Authors:Remco Loos, Florin Manea, Victor Mitrana
View PDF
Abstract: In this paper, we present some results regarding the size complexity of Accepting Networks of Evolutionary Processors with Filtered Connections (ANEPFCs). We show that there are universal ANEPFCs of size 10, by devising a method for simulating 2-Tag Systems. This result significantly improves the known upper bound for the size of universal ANEPFCs which is 18.
We also propose a new, computationally and descriptionally efficient simulation of nondeterministic Turing machines by ANEPFCs. More precisely, we describe (informally, due to space limitations) how ANEPFCs with 16 nodes can simulate in O(f(n)) time any nondeterministic Turing machine of time complexity f(n). Thus the known upper bound for the number of nodes in a network simulating an arbitrary Turing machine is decreased from 26 to 16.
Subjects: Formal Languages and Automata Theory (cs.FL); Computational Complexity (cs.CC)
Cite as: arXiv:0907.5130 [cs.FL]
  (or arXiv:0907.5130v1 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.0907.5130
Journal reference: EPTCS 3, 2009, pp. 173-182
Related DOI: https://doi.org/10.4204/EPTCS.3.16

Submission history

From: EPTCS [view email]
[v1] Wed, 29 Jul 2009 13:57:19 UTC (19 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2009-07
Change to browse by:
cs
cs.CC

References & Citations

DBLP - CS Bibliography

listing | bibtex
Remco Loos
Florin Manea
Victor Mitrana
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)