Vimeo / billpage's likeshttp://vimeo.com/user6148258/likesVideos billpage likes on Vimeo.Sat, 19 Apr 2014 05:55:36 -0400Vimeohttp://i.vimeocdn.com/portrait/1701961_100x100.jpgVimeo / billpage's likeshttp://vimeo.com/user6148258/likesUntitledSun, 27 Feb 2011 21:14:49 -0500http://vimeo.com/1671299Jamie Vicary<p><a href="http://vimeo.com/1671299"><img src="http://i.vimeocdn.com/video/62252097_200x150.jpg" alt="" /></a></p><p><p class="first">Talk by Bruce Bartlett at "Categories, Logic and the Foundations of Physics".</p></p><p><strong>Cast:</strong> <a href="http://vimeo.com/user726070">Jamie Vicary</a></p><p><strong>Tags:</strong> </p>tag:vimeo,2011-02-27:clip1671299UntitledThe Strategy Challenge in Computer AlgebraSat, 26 Feb 2011 17:22:40 -0500http://vimeo.com/20383382Galois Video<p><a href="http://vimeo.com/20383382"><img src="http://i.vimeocdn.com/video/130173974_200x150.jpg" alt="" /></a></p><p><p class="first">abstract:</p> <p>In automated deduction, strategy is a vital ingredient in effective proof search. Strategy comes in many forms, but the key is this: user-specifiable adaptations of general reasoning mechanisms reduce the search space by tailoring its exploration to a particular class of problems. In fully automatic theorem provers, this may happen through formula weights, term orders and quantifier triggers. In interactive proof assistants, one may build strategies by programming tactics and carefully crafting systems of rewrite rules. Given that automated deduction often takes place over undecidable theories, the recognition of a need for strategy is natural and happened early in the field. In computer algebra, the situation is rather different.</p> <p>In computer algebra, the theories one works over are often decidable but inherently infeasible. For instance, the theory of real closed fields (i.e., nonlinear real arithmetic) is decidable, but any full quantifier elimination algorithm for it is guaranteed to have worst-case doubly exponential time complexity. The situation is similar with algebraically closed fields (e.g., through Groebner bases), and many others. Usually, decision procedures arising from computer algebra admit little means for a user to control them. But, when it comes to practical applications, is an infeasible theory really so different from an undecidable one?</p> <p>The Strategy Challenge in Computer Algebra is this: To build theoretical and practical tools allowing users to exert strategic control over the execution of core computer algebra algorithms. In this way, such algorithms may be tailored to specific problem domains. For formal verification efforts, the focus of this challenge upon decision procedures is especially relevant. In this talk, we will motivate this challenge and present two examples from our dissertation: (i) the theory of Abstract Groebner Bases and its use in developing new Groebner basis algorithms tailored to the needs of SMT solvers (joint with Leo de Moura), and (ii) the theory of Abstract Cylindrical Algebraic Decomposition and a family of real quantifier elimination algorithms tailored to the structure of nonlinear real arithmetic problems arising in specific formal verification tool-chains. The former forms the foundation of nonlinear arithmetic in the SMT solver Z3, and the latter forms the basis of our tool RAHD (Real Algebra in High Dimensions).</p> <p>bio:</p> <p>Grant Olney Passmore is a Postdoctoral Associate at Clare Hall, University Cambridge and Research Associate at LFCS, University Edinburgh. He works on the joint Cambridge-Edinburgh EPSRC grant "Automatic Proof Procedures for Polynomials and Special Functions" with Larry Paulson (Cambridge) and Paul B. Jackson (Edinburgh), continuing work begun in his Edinburgh PhD dissertation "Combined Decision Procedures for Nonlinear Arithmetics: Real and Complex" (supervised by Paul B. Jackson). He is currently on short leave from the grant as a Visiting Researcher with Yuri Gurevich at Microsoft Research, Redmond.</p></p><p><strong>Cast:</strong> <a href="http://vimeo.com/galois">Galois Video</a></p><p><strong>Tags:</strong> <a href="http://vimeo.com/tag:"></a>, <a href="http://vimeo.com/tag:galois">galois</a>, <a href="http://vimeo.com/tag:tech+talk">tech talk</a>, <a href="http://vimeo.com/tag:algebra">algebra</a>, <a href="http://vimeo.com/tag:math">math</a>, <a href="http://vimeo.com/tag:formal+methods">formal methods</a> and <a href="http://vimeo.com/tag:strategies">strategies</a></p>tag:vimeo,2011-02-26:clip20383382The Strategy Challenge in Computer AlgebraDatabases are CategoriesSat, 26 Feb 2011 17:05:01 -0500http://vimeo.com/12428370Galois Video<p><a href="http://vimeo.com/12428370"><img src="http://i.vimeocdn.com/video/69730668_200x150.jpg" alt="" /></a></p><p><p class="first">Talk presented by David Spivak on June 3, 2010, part of the Galois Tech Talk series. See <a href="http://www.galois.com/blog/2010/05/27/tech-talk-categories-are-databases/" target="_blank" rel="nofollow">galois.com/blog/2010/05/27/tech-talk-categories-are-databases/</a> for slides and further information.</p></p><p><strong>Cast:</strong> <a href="http://vimeo.com/galois">Galois Video</a></p><p><strong>Tags:</strong> <a href="http://vimeo.com/tag:category+theory">category theory</a> and <a href="http://vimeo.com/tag:databases">databases</a></p>tag:vimeo,2011-02-26:clip12428370Databases are Categories