ACM Home Page
Please provide us with feedback. Feedback
Algorithms and proofs: mathematics in the computing curriculum
Full text PdfPdf (490 KB)
Source Technical Symposium on Computer Science Education archive
Proceedings of the twentieth SIGCSE technical symposium on Computer science education table of contents
Louisville, Kentucky, United States
Pages: 268 - 272  
Year of Publication: 1989
ISBN:0-89791-289-5
Also published in ...
Author
Newcomb Greenleaf  Columbia Univ., New York, NY
Sponsors
SIGCSE: ACM Special Interest Group on Computer Science Education
IEEE-CS : Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 21,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   reviews   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/65293.65313
What is a DOI?

ABSTRACT

Computing has supplied mathematics with a new vocabulary of algorithms and is holding out the promise that mathematics can be implemented. Algorithms and proofs can now be seen as the same type of object. This new vision of mathematics as a very high level programming language suggests that mathematics may be transformed so that it is more in harmony with the spirit of computing, and has profound implications for the way in which mathematics is taught. Such harmony would be particularly beneficial for students of computing, who often find little of relevance in their mathematics courses.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Bishop, E., Foundations of Constructive Analysis, McGraw-Hill, 1967. {Revised edition: Bishop, E. and Bridges, D., Constructive Analysis, Springer-Verlag, 1985.}
 
3
Brouwer, L. E. J., Collected Works, Vol. 1 - Philosophy and Foundations of Mathematics, North-Holland, 1975.
 
4
 
5
Denning, P. J., et al., Report of the ACM Task Force on the Core of Computer Science, ACM, 1988.
 
6
 
7
Greenleaf, N., Liberal constructive set theory, Constructive Mathematics, Richman, F., Ed., Springer Lecture Notes in Mathematics, Vol. 873, 1981.
 
8
 
9
Martin-L~f, P., Constructive mathematics and computer programming, Sixth International Congress for Logic, Methodology, and Philosophy of Science, Cohen, L. J. et al., Eds., North-Holland, 1982.
 
10



REVIEWS

"William George Frederick : Reviewer"

In the abstract of this paper, the author claims “that mathematics can be implemented.” I thought that was a curious statement, or at least curious enough for me to read on and become better informed as to its intent. After trying to  more...


"Newcomb Greenleaf : Reviewer"

My paper attempted to suggest that computer scientists should consider looking at mathematics algorithmically. The heart of this approach involves trying to understand the triple (assumption, proof, conclusions) in terms of (input data, algori  more...