1302 search results - page 30 / 261 » Free-Style Theorem Proving |
101
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
The Shannon-McMillan-Breiman theorem asserts that the sample entropy of a stationary and ergodic stochastic process converges to the entropy rate of the same process almost surely...
JCT
2011
14 years 6 months ago
2011
We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to e...
CADE
2001
Springer
16 years 5 days ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
115
click to vote
EUSFLAT
2009
14 years 9 months ago
2009
We examine generalizations of random variables and martingales. We prove a new convergence theorem for setvalued martingales. We also generalize a well known characterization of se...
APAL
1998
14 years 11 months ago
1998
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...