1677 search results - page 50 / 336 » On the Completeness of Quantum Computation Models |
TCS
1998
15 years 1 months ago
1998
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...
LOGCOM
2010
14 years 12 months ago
2010
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
FCT
2005
Springer
15 years 7 months ago
2005
Springer
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
130
click to vote
CCGRID
2006
IEEE
15 years 7 months ago
2006
IEEE
— Desktop grids use the idle cycles of desktop PC’s to provide huge computational power at low cost. However, because the underlying desktop computing resources are volatile, a...
109
click to vote
VTS
2003
IEEE
15 years 6 months ago
2003
IEEE
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...