1717 search results - page 117 / 344 » A Computable Spectral Theorem |
153
click to vote
JMLR
2010
15 years 1 months ago
2010
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
165
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
127
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
The first extensive number-theoretical computation run on the world's first U.S. digital general-purpose electronic computer, the ENIAC, is reconstructed. The problem, computi...
167
click to vote
MKM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process ...
176
click to vote
ENTCS
2008
15 years 6 months ago
2008
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...