429 search results - page 36 / 86 » Turing computations on ordinals |
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...
BIRTHDAY
2010
Springer
15 years 27 days ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
APAL
2005
14 years 11 months ago
2005
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...
103
click to vote
BMCBI
2008
14 years 12 months ago
2008
Background: Multivariate ordination methods are powerful tools for the exploration of complex data structures present in microarray data. These methods have several advantages com...
108
click to vote
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...