921 search results - page 6 / 185 » Abstract Matrix Arithmetic |
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
FMCAD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We have formal verified a number of algorithms for evaluating transcendental functions in double-extended precision floating point arithmetic in the Intel
FCS
2008
2008
Why Brouwer Was Justified in his Objection to Hilbert's Unqualified Interpretation of Quantification
13 years 9 months ago
Abstract We define a finitary model of firstorder Peano Arithmetic in which quantification is interpreted constructively in terms of Turingcomputability, and show that it is incons...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
MCU
2004
13 years 8 months ago
2004
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...