[图书][B] Computing with cells and atoms: an introduction to quantum, DNA and membrane computing

C Calude, G Paun - 2000 - books.google.com
At the turning of the millennium, a switch in computing technology is forecasted and looked
for. Two main directions of research, both based on quite unconventional ideas are most …

Frontier between decidability and undecidability: a survey

M Margenstern - Theoretical Computer Science, 2000 - Elsevier
After recalling the definition of decidability and universality, we first give a survey of results
on the as exact as possible border betweeen a decidable problem and the corresponding …

The complexity of small universal Turing machines: A survey

D Woods, T Neary - Theoretical Computer Science, 2009 - Elsevier
We survey some work concerned with small universal Turing machines, cellular automata,
tag systems, and other simple models of computation. For example, it has been an open …

A universal reversible Turing machine

K Morita, Y Yamaguchi - … 5th International Conference, MCU 2007, Orléans …, 2007 - Springer
A reversible Turing machines is a computing model with a “backward deterministic” property,
which is closely related to physical reversibility. In this paper, we study the problem of finding …

[PDF][PDF] Digital signature scheme based on a new hard problem

M Nikolay - Computer Science Journal of Moldova, 2008 - ibn.idsi.md
Factorizing composite number n= qr, where q and r are two large primes, and finding
discrete logarithm modulo large prime number p are two difficult computational problems …

The complexity of small universal Turing machines: a survey

T Neary, D Woods - International Conference on Current Trends in Theory …, 2012 - Springer
We survey some work concerned with small universal Turing machines, cellular automata,
tag systems, and other simple models of computation. For example it has been an open …

Three small universal Turing machines

C Baiocchi - … , and Universality: Third International Conference, MCU …, 2001 - Springer
We are interested by “small” Universal Turing Machines (in short: UTMs), in the framework of
2, 3 or 4 tape—symbols. In particular: tape—symbols. Apart from the old 24—states machine …

Variants of small universal P systems with catalysts

A Alhazov, R Freund - Fundamenta Informaticae, 2015 - content.iospress.com
Computational completeness is known for P systems with two catalysts and purely catalytic
P systems with three catalysts as well as for P systems with one bi-stable catalyst. We …

A universal Turing machine with 3 states and 9 symbols

M Kudlek, Y Rogozhin - … in Language Theory: 5th International Conference …, 2002 - Springer
A Universal Turing Machine with 3 States and 9 Symbols Page 1 A Universal Turing Machine with
3 States and 9 Symbols Manfred Kudlek 1 and Yurii Rogozhin 2 1 Fachbereich Informatik …

[PDF][PDF] Small universal Turing machines

T Neary - 2008 - Citeseer
Numerous results for simple computationally universal systems are presented, with a
particular focus on small universal Turing machines. These results are towards finding the …