457 search results - page 9 / 92 » Hypercomputation: computing more than the Turing machine |
78
Voted
JUCS
2002
14 years 9 months ago
2002
: A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals p...
DLT
2003
14 years 11 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
FUIN
2006
14 years 9 months ago
2006
Abstract. With inspiration from the economic reality, where numbers are basic entities to work with, we propose a genuinely new kind of P systems, where numerical variables evolve,...
65
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...