244 search results - page 46 / 49 » Turing machines and bimachines |
STOC
1989
ACM
15 years 1 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
96
Voted
CIAC
2010
Springer
15 years 1 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
ESCIENCE
2006
IEEE
15 years 1 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
CJ
2006
14 years 9 months ago
2006
Abstract. Uncertainty is an inherent property of all living systems. Curiously enough, computational models inspired by biological systems do not take, in general, under considerat...