989 search results - page 35 / 198 » Pebbling and Proofs of Work |
FUIN
2007
13 years 8 months ago
2007
Using 1947 work of Post showing that the word problem for semigroups is unsolvable, we explicitly exhibit an algebraic characterization of the bits of the halting probability Ω....
ARITH
1999
IEEE
1999
IEEE
Correctness Proofs Outline for Newton-Raphson Based Floating-Point Divide and Square Root Algorithms
14 years 19 days ago
This paper describes a study of a class of algorithms for the floating-point divide and square root operations, based on the Newton-Raphson iterative method. The two main goals we...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
CAV
1998
Springer
14 years 16 days ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
EJC
2007
13 years 8 months ago
2007
We prove that the translation plane and the shift plane defined by a planar partition function form an oval pair of projective planes in the sense that the planes share a line pe...