Abstract
We began from the observation that most of our students find algorithms easy and natural and proofs difficult and obscure, and are totally unaware of the close relationship between algorithms and proofs. This observation led to the hypothesis that pan of the problem lay in the fact that the students had been bom into the algorithmic age, which their mathematics courses had largely yet to enter. This paper explores various ways in which mathematics courses can be made more algorithmic, both in style and in content. Particular attention will be paid to the term non-computable function, which will be seen as oxymoronic. An algorithmic explanation will be developed, particularly for the busy beaver function. We shall also give an algorithmic analysis of Cantor's diagonal method.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abelson, H. and Sussman, G. J. Structure and Interpretation of Computer Programs. M. I. T. Press, 1984.
Bates, J. L. and Constable, R. L. “Proofs as programs”. ACM Transactions on Programming Languages and Systems 7 (1985), 113–136.
Beeson, M. Computerizing mathematics: logic and computation. In Herken, R., Ed., The Universal Turing Machine: a Half-Century Survey, Oxford University Press, 1988, pp. 191–225.
Bishop, E. Foundations of Constructive Analysis. McGraw-Hill, 1967. [5] is a new edition.
Bishop, E. and Bridges, D. Constructive Analysis. Springer-Verlag, 1985. evised edition of [4].
Bishop, E. Contemporary Mathematics. Volume 39: Schizophrenia in Contemporary Mathematics. In Rosenblatt, M., Ed., Errett Bishop: Reflections on Him and His Research, American Mathematical Society, 1985. Originally distributed as the American Mathematical Society Colloquium Lectures in 1973.
Boolos, G. S., and Jeffrey, R. C. Computability and Logic. Cambridge University Press, 1980.
Brady, A. H. The busy beaver game and the meaning of life. In Herken, R., Ed., The Universal Turing Machine: a Half-Century Survey, Oxford University Press, 1988, pp. 259–278.
Cohen, D. I. A. Introduction to Computer Theory. John Wiley and Sons, 1986.
Constable, R. L. “Programs as proofs: a synopsis”. Information Processing Letters 16 (1983), 105–112.
Dalen, D. van. Singleton Reals. In Logic Colloquium '80, North-Holland, 1982, pp. 83–94.
Dauben, J., W. Georg Cantor: His Mathematics and Philosophy of the Infinite. Harvard University Press, 1979.
Dewdney, A. K. “Computer Recreations”. Scientific American 252 (April, 1984), 20–30. Reprinted in The Armchair Universe, Freeman, 1988, 160–171.
Eco, Umberto. Foucault's Pendulum. Harcourt Brace Jovanovich, 1989.
Ershov, A. P., and Knuth, D. E. (Ed.) Algorithms in Modern Mathematics and Computer Science. Springer Lecture Notes in Computer Science, 1981.
Greenleaf, N. Liberal constructive set theory. In Richman, F., Ed., Constructive Mathematics, Springer Lecture Notes in Mathematics, Vol. 873, 1981, pp. 213–240.
Greenleaf, N. “Algorithms and proofs: mathematics in the computing curriculum”. ACM SIGCSE Bulletin 21 (1989), 268–272.
Hallett, M. Cantorian Set Theory and Limitation of Size. Oxford University Press, 1984.
Knuth, D. E. The Art of Computer Programming. Volume 1: Fundamental Algorithms. Addison-Wesley, 1973.
Knuth, D. E. Algorithms in modern mathematics and computer science. In Algorithms in Modern Mathematics and Computer Science, Springer Lecture Notes in Computer Science, Vol 122, 1981, pp. 82–99. Revised (from ALGOL to Pascal) and reprinted in American Mathematical Monthly 92 (1985), 170–181.
Lewis, H. and Papadimitriou, C. Elements of the Theory of Computation. Prentice-Hall, 1981.
Martin-Lof, P. Constructive mathematics and computer programming, In Sixth International Congress for Logic, Methodology, and Philosophy of Science, North-Holland, 1982. Reprinted in Mathematical Logic and Programming Languages, Hoare, C. A. R. and Shepherdson, J. C. (eds.), Prentice-Hall, 1986.
Moerdijk, I. “Review of Mathematical Intuitionism. Introduction to Proof Theory”. Bull. Amer. Math. Society 22 (1990), 301–304.
Murthy, C. Classical Proofs as Programs: How, What, and Why. These Proceedings, 1991.
Myers, J. P., Jr. “The central role of mathematical logic in computer science”. ACM SIGCSE Bulletin 22 (1990), 22–26.
Rado.T. “On non-computable functions”. Bell Sys. Tech. Journal (1962), 887–884.
Stewart, I. “The ultimate in undecidability”. Nature 332 (10 March 1988), 115–116.
Troelstra, A. S. “Intuitionistic extensions of the reals”. Nieuw Arch. Wisk. 28 (1980), 63–113.
Wittgenstein, L. Remarks on the Foundations of Mathematics. Basil Blackwell, 1956. Translated by G. E. M. Anscombe.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greenleaf, N. (1992). Bringing mathematics education into the algorithmic age. In: Myers, J.P., O'Donnell, M.J. (eds) Constructivity in Computer Science. Constructivity in CS 1991. Lecture Notes in Computer Science, vol 613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021092
Download citation
DOI: https://doi.org/10.1007/BFb0021092
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55631-2
Online ISBN: 978-3-540-47265-0
eBook Packages: Springer Book Archive