410 search results - page 63 / 82 » Interval Arithmetic and Standardization |
CORR
2008
Springer
13 years 7 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 ...
ENTCS
2008
13 years 7 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
ESWA
2007
13 years 7 months ago
2007
In this paper we present an application of rule-based expert systems to a farming problem. Concretely the prediction of the breeding value in Manchego ewes is studied for the earl...
INFORMATICALT
1998
13 years 7 months ago
1998
Abstract. We study invertibility of big n × n matrices. There exists a number of algorithms, especially in mathematical statistics and numerical mathematics, requiring to invert s...