64 search results - page 5 / 13 » Proving Church's Thesis |
103
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
120
click to vote
STOC
1993
ACM
15 years 6 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...
85
Voted
IWFM
1998
15 years 3 months ago
1998
Vagueness is the phenomenon that natural language predicates have borderline regions of applicability and that the boundaries of the borderline region are not determinable. A theo...
110
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Physical processes are computations only when we use them to externalize thought. Entities provide nature with a way to preserve structure over time. We think in terms of entities ...
131
click to vote
TOCL
2008
15 years 1 months ago
2008
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...