233 search results - page 13 / 47 » Interactive Proofs For Quantum Computations |
120
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
CIE
2006
Springer
15 years 3 months ago
2006
Springer
We describe two representations for real numbers, signed digit streams and Cauchy sequences. We give coinductive proofs for the correctness of functions converting between these tw...
109
click to vote
COMGEO
2011
ACM
14 years 3 months ago
2011
ACM
ABSTRACT . Categories and Subject Descriptors K. Computing Milieux K.m MISCELLANEOUS General Terms Theory Keywords Cyber-physics, Internet of Things, Quantum computing Cloud Comput...
105
click to vote
AIMSA
1998
Springer
15 years 4 months ago
1998
Springer
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
109
click to vote
CADE
1990
Springer
15 years 3 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...