242 search results - page 27 / 49 » Zigzags in Turing Machines |
MST
2007
13 years 7 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
13 years 2 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). ...
POPL
2008
ACM
14 years 8 months 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
14 years 2 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...
AML
2008
13 years 7 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...