7 search results - page 1 / 2 » Paraconsistent Machines and their Relation to Quantum Comput... |
LOGCOM
2010
12 years 11 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
STOC
1993
ACM
13 years 8 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...
FUNGAMES
2008
13 years 5 months ago
2008
Recent developments in computer science introduce and discuss new concepts for computation beyond universal Turing machines. Quantum computing relates to new insights in quantum ph...
CIE
2007
Springer
13 years 10 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
ICCS
2004
Springer
13 years 10 months ago
2004
Springer
: Synchronous finite state machines are very important for digital sequential designs. Among other important aspects, they represent a powerful way for synchronizing hardware comp...