429 search results - page 33 / 86 » Noisy Turing Machines |
FUIN
2002
14 years 11 months ago
2002
We present a direct universal P system based on splicing. Our approach differs from those shown in previous papers as the P system we construct takes as input an encoding of anothe...
112
click to vote
MST
2007
14 years 11 months ago
2007
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations a...
MST
2011
14 years 6 months ago
2011
Abstract. In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product Z ≀ (Z × Z). ...
203
click to vote
POPL
2008
ACM
16 years 3 days ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
UC
2009
Springer
15 years 6 months ago
2009
Springer
Geometrical Computation and Computable Analysis J´erˆome Durand-Lose⋆ Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P. 6759, F-45067 OR...