Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Home Topics Titles Quotes Blog Featured Help
James Harold Davenport
University of Bath
Bath, United Kingdom

In 1969, the team that developed the ATM at IBM Hursley (UK) used parts from that project to build an IBM School Computer, as a community outreach project, and it toured the region. When it came to James Davenport’s school, he (at age 16) discovered that, although it was ostensibly a six-digit computer, the microcode had access to a 12-digit internal register to do multiply/divide. He therefore used this to implement Draim's algorithm from his father's book, The Higher Arithmetic, and was testing eight-digit numbers for primality until the teacher’s patience wore out.

This is typical of Davenport’s lifelong interests: pushing computers to their limits to do mathematical computations. He worked in a government laboratory for nine months, again writing and using multiword arithmetic, but also using his knowledge of number theory to solve a problem in hashing, which earned him his first published paper at 18. He went to Cambridge University (Bachelor’s in 1974, Master’s in 1978, and PhD in 1980), to IBM Yorktown Heights for a year, back to Cambridge as a Research Fellow, to Grenoble for a year, which significantly improved his French, as well as his cooking, before going to the relatively new University of Bath “for a couple of years" in 1983. He is still there, though he has also spent time researching and teaching in many other countries. In 1986 in France, he finished his textbook Calcul Formel with Grenoble colleagues, which his mother translated into English as Computer Algebra.

Computer algebra remains his main research interest: as he says, “You don't really understand a subject until you can program a computer do to it, and that goes for mathematics at least as much as anything else.” He is finishing a new textbook on the subject, and has also edited four volumes of conference proceedings on the subject, as well as writing over 100 refereed papers. He has also produced four new editions of The Higher Arithmetic. He is active in the UK's professional world as a vice-president of the British Computer Society, the representative of the Institute of Mathematics and Its Applications on the London Mathematical Society’s Computer Science Committee, and a member of the Outer Circle of the National Advisory Committee on [School] Mathematics Education. In 2014, he was one of only two computer scientists chosen among the 55 national teaching fellows (and Tom Crick, the other one, had studied at Bath). Internationally, he is on the Committee for Electronic Information and Communication of the International Mathematical Union, and just moderated the panel on mathematical MOOCs at the 2014 International Congress of Mathematicians.

Is he a mathematician or a computer scientist? “Yes, and if that were a conjunction rather than a disjunction, I would still say yes. What attracted me to Bath was that mathematics and computer science were one department, and when colleagues felt that growth made a split necessary, I was made a member of both departments.”

What attracts him most to Computing Reviews is the ability to read books and papers he would not otherwise read. “We examine PhD students, not just on their thesis, but also on the broader area. How do we professors keep up ourselves? Reviewing for Computing Reviews is my way.”


Learn Raspberry Pi programming with Python
Donat W.,  Apress, Berkeley, CA, 2014. 256 pp. Type: Book (978-1-430264-24-8)

This book is bizarrely titled. What “learn programming” book has a section called “Bonus: Soldering Techniques,” or contains the sentence, “You’ll need to purchase or rent a tank of helium from a party supply...


The new group theory package in Maple 17
Postma E.  ACM Communications in Computer Algebra 47(3/4): 174-178, 2013. Type: Article

Computer algebra systems are generally divided [1] into those that treat groups, or other mathematical structures, such as GAP, Cayley, and Magma, and those that treat polynomials and objects built from polynomials, such as Macsyma and its...


Compressed matrix multiplication
Pagh R.  ACM Transactions on Computation Theory (TOCT) 5(3): 1-17, 2013. Type: Article, Reviews: (2 of 2)

This paper is concerned with approximating a matrix product, that is, finding the large entries (AB){i,j} [and the corresponding indices...


Lower bounds for decomposable univariate wild polynomials
Von Zur Gathen J.  Journal of Symbolic Computation 50409-430, 2013. Type: Article

According to the author,
a univariate polynomial f over a field is decomposable if it is the composition f = g º h of two polynomials...

Secure multi-party computation
Prabhakaran M., Sahai A.,  IOS PRESS, Amsterdam, the Netherlands, 2013. 296 pp. Type: Book (978-1-614991-68-7)

Secure multiparty computation can be illustrated by the following example: Ten honest, but suspicious, university presidents wish to know their average (that is, mean) salary, but without revealing their salaries to each other. This is trivially...


Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2014 ThinkLoud, Inc.
Terms of Use
| Privacy Policy