International audienceThe book under review, first published some twenty years ago, is the product of a group of French historians of mathematics: Jean-Luc Chabert, Evelyn Barbin, Michel Guillemot, Anne Michel-Pajus, Jacques Borowczyk, Ahmed Djebbar et Jean-Claude Martzloff. An English translation by Chris Weeks was published by Springer in 1999 (Chabert et al., 1999) and a second French edition is now available and will be reviewed here. It was at the time of its first appearance—and is still— the sole book-length study of the history of mathematical algorithms. Therefore this second corrected and extended edition of the French original is most welcome. The original edition of Histoire d'algorithmes was published at a time of developing in...
International audienceMost of what changes from one first-millennium lì 曆 procedure text to another ...
International audienceMost of what changes from one first-millennium lì 曆 procedure text to another ...
The Euclidean algorithm for computing the greatest common divisor of two integers is, as D. E. Knuth...
International audienceThe book under review, first published some twenty years ago, is the product o...
International audienceThe content of Adam Ries’ book (1574) with the instructions to written arithme...
Until some decades ago, it was customary to discuss much pre-Modern mathematics as “algebra”, withou...
This article focuses on three features proofs of the correctness of algorithms found in ancient math...
This article focuses on three features proofs of the correctness of algorithms found in ancient math...
Webster's Collegiate Dictionary defines an algorithm as "a rule of procedure for solving a...
The controversial matters surrounding the notion of anachronism are difficult ones: they have been b...
The History of Mathematics: A Source-Based Approach is a comprehensive history of the development of...
This paper describes the objectives, content, learning methodology and results of an online course o...
This paper provides a historical account of the development of algorithmic complexity in a form that...
The goal of this chapter is to bring to the attention of philosophers of mathematics the concept of ...
About the book: This Handbook explores the history of mathematics under a series of themes which ra...
International audienceMost of what changes from one first-millennium lì 曆 procedure text to another ...
International audienceMost of what changes from one first-millennium lì 曆 procedure text to another ...
The Euclidean algorithm for computing the greatest common divisor of two integers is, as D. E. Knuth...
International audienceThe book under review, first published some twenty years ago, is the product o...
International audienceThe content of Adam Ries’ book (1574) with the instructions to written arithme...
Until some decades ago, it was customary to discuss much pre-Modern mathematics as “algebra”, withou...
This article focuses on three features proofs of the correctness of algorithms found in ancient math...
This article focuses on three features proofs of the correctness of algorithms found in ancient math...
Webster's Collegiate Dictionary defines an algorithm as "a rule of procedure for solving a...
The controversial matters surrounding the notion of anachronism are difficult ones: they have been b...
The History of Mathematics: A Source-Based Approach is a comprehensive history of the development of...
This paper describes the objectives, content, learning methodology and results of an online course o...
This paper provides a historical account of the development of algorithmic complexity in a form that...
The goal of this chapter is to bring to the attention of philosophers of mathematics the concept of ...
About the book: This Handbook explores the history of mathematics under a series of themes which ra...
International audienceMost of what changes from one first-millennium lì 曆 procedure text to another ...
International audienceMost of what changes from one first-millennium lì 曆 procedure text to another ...
The Euclidean algorithm for computing the greatest common divisor of two integers is, as D. E. Knuth...