• DocumentCode
    2405989
  • Title

    Babylonian method of computing the square root: Justifications based on fuzzy techniques and on computational complexity

  • Author

    Kosheleva, Olga

  • Author_Institution
    Dept. of Math. Educ., Univ. of Texas at El Paso, El Paso, TX, USA
  • fYear
    2009
  • fDate
    14-17 June 2009
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    When computing a square root, computers still, in effect, use an iterative algorithm developed by the Babylonians millennia ago. This is a very unusual phenomenon, because for most other computations, better algorithms have been invented - even division is performed, in the computer, by an algorithm which is much more efficient that division methods that we have all learned in school. What is the explanation for the success of the Babylonians´ method? One explanation is that this is, in effect, Newton´s method, based on the beast ideas from calculus. This explanations works well from the mathematical viewpoint - it explains why this method is so efficient, but since the Babylonians were very far from calculus, it does not explain why this method was invented in the first place. In this paper, we provide two possible explanations for this method´s origin. We show that this method naturally emerges from fuzzy techniques, and we also show that it can be explained as (in some reasonable sense) the computationally simplest techniques.
  • Keywords
    computational complexity; fuzzy set theory; Babylonian method; Newton´s method; computational complexity; fuzzy technique; iterative algorithm; square root; Approximation algorithms; Calculus; Computational complexity; Computer science education; Convergence; Educational institutions; Information processing; Iterative algorithms; Mathematics; Newton method;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fuzzy Information Processing Society, 2009. NAFIPS 2009. Annual Meeting of the North American
  • Conference_Location
    Cincinnati, OH
  • Print_ISBN
    978-1-4244-4575-2
  • Electronic_ISBN
    978-1-4244-4577-6
  • Type

    conf

  • DOI
    10.1109/NAFIPS.2009.5156463
  • Filename
    5156463