Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Mathematics, computer science and logic - a never ending story : the Bruno Buchberger Festschrift
Paule P., Springer Publishing Company, Incorporated, New York, NY, 2013. 120 pp. Type: Book (978-3-319009-65-0)
Date Reviewed: Jan 27 2014

A writer in the journal Nature once said that “festschriften are for men who have put their stamp on some branch of enquiry during a certain period of time” [1]. Bruno Buchberger, the honoree of this festschrift, more than meets that description. He founded the theory of Gröbner bases (which, with characteristic modesty, he named after his supervisor), a field that today is responsible for several textbooks, sessions in most computer algebra conferences, and implementations in any reasonable general-purpose computer algebra system (as well as several specialist ones, including CoCoA, Macaulay, and Singular, to name but three). The field even has its own mathematics subject classification: “13P10 Polynomial ideals, Groebner bases.” While this volume does not say much about Buchberger himself, the curious reader can consult a 2006 paper [2] for more on his life and work. In fact, it is the lead paper in the festschrift special (double) issue of the Journal of Symbolic Computation, which Buchberger founded over 20 years before.

This book contains the more philosophical papers common in festschriften, which would have been out of place in the previous publication:

In “Foundations of Mathematics from the Perspective of Computer Verification,” author Henk Barendregt presents a powerful piece arguing for the unity of mathematics and the importance of computer verification.

In “On the Role of Logic and Algebra in Software Engineering,” Manfred Broy has written a powerful essay precisely described by its title, and one that I shall be bringing to my own department during our next curriculum review.

Stephen Wolfram’s “New Directions in the Foundations of Mathematics (2002)” is a talk written in 2002, predating his later work, Wolfram Alpha.

In “Towards a Symbolic Computation Philosophy (and Methodology!) for Mathematics,” Doron Zeilberger makes the strong point that recent developments mean that many identities that used to have to be proved, or even discovered and proved, can now be computed.

All in all, I found this a useful set of papers using the umbrella of the festschrift to talk about what we are building, rather than just adding more bricks.

Reviewer:  J. H. Davenport Review #: CR141936 (1404-0255)
1) Buchdahl, G. Nagel’s message. Nature 231, (1971), 399–399.
2) Hong, H.; Kapur, D.; Paule, P.; Winkler, F. Bruno Buchberger -- a life devoted to symbolic computation. Journal of Symbolic Computation 41, 3/4(2006), 255–258.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Symbolic and Algebraic Manipulation (I.1 )
 
 
Mathematical Logic (F.4.1 )
 
 
Introductory And Survey (A.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Symbolic and Algebraic Manipulation": Date
Data structure properties for scientific computing: an algebraic topology library
Heinzl R.  POOSC 2009 (Proceedings of the 8th Workshop on Parallel/High-Performance Object-Oriented Scientific Computing, Genova, Italy, Jul 7, 2009)1-6, 2009. Type: Proceedings
Oct 27 2009
Estimating the number of tetrahedra determined by volume, circumradius and four face areas using Groebner basis
Tsai Y. Journal of Symbolic Computation 77162-174, 2016. Type: Article
Feb 22 2017
Cause-effect structures: An Algebra of Nets with Examples of Applications
Czaja L., Springer Publishing Company, Incorporated, 2019.  160, Type: Book (978-3-030204-60-0)
Apr 12 2022

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy