Membrane Computing as Multi Turing Machines
نویسندگان
چکیده
منابع مشابه
Molecular computing: paths to chemical Turing machines
To comply with the rapidly increasing demand of information storage and processing, new strategies for computing are needed. The idea of molecular computing, where basic computations occur through molecular, supramolecular, or biomolecular approaches, rather than electronically, has long captivated researchers. The prospects of using molecules and (bio)macromolecules for computing is not withou...
متن کاملA formalization of multi-tape Turing machines
We discuss the formalization, in the Matita Theorem Prover, of basic results on multi-tapes Turing machines, up to the existence of a (certified) Universal Machine, and propose it as a natural benchmark for comparing different interactive provers and assessing the state of the art in the mechanization of formal reasoning. The work is meant to be a preliminary step towards the creation of a form...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملSimulations of Quantum Turing Machines by Quantum Multi-Stack Machines
As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved that for any quantum Turing machines M , there exists quantum Boolean circuit (n, t)-simulating M , where n denotes the length of input strings, and t is th...
متن کاملSimulations of Quantum Turing Machines by Quantum Multi-Counter Machines
We define quantum multi-stack machines (abbr. QMSMs) by generalizing quantum pushdown automata (abbr. QPDAs) dealt with before from one-stack to multi-stack, and the well-formedness (abbr. W-F) conditions for characterizing the unitary evolution are presented. Afterwards, by means of QMSMs we define quantum multi-counter machines (abbr. QMCMs) that are somewhat different from the quantum counte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2012
ISSN: 2249-0868
DOI: 10.5120/ijais12-450764