244 search results - page 29 / 49 » Turing machines and bimachines |
105
click to vote
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
DAM
1998
14 years 11 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
ML
2007
ACM
14 years 11 months ago
2007
ACM
The need for flexible forms of serialisation arises under many circumstances, e.g. for doing high-level inter-process communication or to achieve persistence. Many languages, inc...
67
Voted
CIE
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...
FUNGAMES
2008
15 years 26 days ago
2008
Recent developments in computer science introduce and discuss new concepts for computation beyond universal Turing machines. Quantum computing relates to new insights in quantum ph...