Can We Learn Algorithms from People Who Compute Fast: An Indirect Analysis in the Presence of Fuzzy Descriptions
In the past, mathematicians actively used the ability of some people to perform calculations unusually fast. With the advent of computers, there is no longer need for human calculators - even fast ones. However, recently, it was discovered that there exist, e.g., multiplication algorithms which are much faster than standard multiplication. Because of this discovery, it is possible than even faster algorithm will be discovered. It is therefore natural to ask: did fast human calculators of the past use faster algorithms - in which case we can learn from their experience - or they simply performed all operations within a standard algorithm much faster? This question is difficult to answer directly, because the fast human calculators’ self description of their algorithm is very fuzzy. In this paper, we use an indirect analysis to argue that fast human calculators most probably used the standard algorithm.
KeywordsFuzzy Logic Fast Algorithm Inverse Fourier Transform Standard Algorithm Time Ratio
Unable to display preview. Download preview PDF.
- 1.Beckmann, P.: A History of π. Barnes & Noble, New York (1991)Google Scholar
- 4.d’Ocagne, M.: Le Calcul Simplifié: Graphical and Mechanical Methods for Simplifying Calculation. MIT Press, Cambridge (1986)Google Scholar
- 5.Hofstadter, D.R.: Godel, Escher, Bach: an Eternal Golden Braid. Basic Books (1999)Google Scholar
- 7.Luria, A.R.: The mind of a mnemonist: a little book about a vast memory. Hardard University Press, Cambridge (1987)Google Scholar
- 9.Stepanov, O., http://stepanov.lk.net/
- 10.Tocquet, R.: The Magic of Numbers. Fawcett Publications, Robbinsdale (1965)Google Scholar