Sciweavers

1410 search results - page 64 / 282
» Proving theorems by reuse
Sort
View
APAL
1998
71views more  APAL 1998»
13 years 9 months ago
Splitting Theorems and the Jump Operator
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...
Rodney G. Downey, Richard A. Shore
TIT
2002
87views more  TIT 2002»
13 years 9 months ago
Coding theorems for turbo code ensembles
This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles of parallel and serial turbo codes are "good" in the following sense. For a tur...
Hui Jin, Robert J. McEliece
DIS
2007
Springer
14 years 4 months ago
Computational Discovery in Pure Mathematics
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
Simon Colton
ISIPTA
2003
IEEE
106views Mathematics» more  ISIPTA 2003»
14 years 3 months ago
Continuous Linear Representation of Coherent Lower Previsions
This paper studies the possibility of representing lower previsions by continuous linear functionals. We prove the existence of a linear isomorphism between the linear space spann...
Sebastian Maaß
DATE
1999
IEEE
123views Hardware» more  DATE 1999»
14 years 2 months ago
Accounting for Various Register Allocation Schemes During Post-Synthesis Verification of RTL Designs
This paper reports a formal methodology for verifying a broad class of synthesized register-transfer-level (RTL) designs by accommodating various register allocation/optimization ...
Nazanin Mansouri, Ranga Vemuri