Turing computability and membrane computing

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Alan Turing began a new area in science; he discovered that there are universal computers, which in principal are very simple. Up to now this is the basis of a modern computing theory and practice. In the paper one considers Turing computability in the frame of P (membrane) systems and other distributive systems. An overview of the recent results about small universal P and DNA systems and some open problems and possible directions of investigation are presented. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Rogozhin, Y., & Alhazov, A. (2012). Turing computability and membrane computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7762 LNCS, pp. 56–77). https://doi.org/10.1007/978-3-642-36751-9_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free