562 search results - page 15 / 113 » Concurrent Turing Machines |
116
click to vote
BIRTHDAY
2008
Springer
15 years 1 months ago
2008
Springer
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
HAPTICS
2010
IEEE
15 years 4 months ago
2010
IEEE
In the Turing test, a computer model is deemed to “think intelligently” if it can generate answers that are not distinguishable from those of a human. This test is limited to t...
DNA
2006
Springer
15 years 3 months ago
2006
Springer
P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve i...
CATS
2006
15 years 1 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
MST
2002
14 years 11 months ago
2002
Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that...