244 search results - page 8 / 49 » Turing machines and bimachines |
101
click to vote
FOSSACS
2011
Springer
14 years 29 days ago
2011
Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
EUROGP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
68
Voted
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
ECCC
2002
14 years 9 months ago
2002
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence sugge...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...