1302 search results - page 80 / 261 » Free-Style Theorem Proving |
STOC
1994
ACM
13 years 12 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
VLSID
2006
IEEE
14 years 1 months ago
2006
IEEE
The main result of this paper, proved as a theorem, is that a lower bound on the number of test vectors that detect each fault at least N times is N
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
EJC
2007
13 years 7 months ago
2007
We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel’s result.
JSYML
2006
13 years 7 months ago
2006
R FOR TAME ABSTRACT ELEMENTARY CLASSES RAMI GROSSBERG AND MONICA VANDIEREN We prove a categoricity transfer theorem for tame abstract elementary classes.