73 search results - page 1 / 15 » Observability of Turing Machines: A Refinement of the Theory... |
INFORMATICALT
2010
13 years 2 months ago
2010
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
STOC
1993
ACM
13 years 9 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...
TCS
2010
12 years 11 months ago
2010
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ Π0 2 ) computational power (as noise level tends to 0) is obt...
SIGCSE
2006
ACM
13 years 11 months ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...