Learning Discrete Mathematics and

Computer Science

via Primary Historical Sources

 

 

 

Projects

 

Instructions on the use of projects

 

Instructions for testers

 

What our students say

 

People

 

Papers and Presentations

 

Collaborative visits

 

Special Recognition

 

Contact

 


This is a Phase II expansion grant from the National Science Foundation (2008-2011). The goal of the project is to develop, classroom test, evaluate and disseminate projects based on primary historical sources in Discrete Mathematics, Combinatorics, Logic and Computer Science courses.

This is a collaborative project between Mathematics (Math) and Computer Science (CS) faculty at New Mexico State University (NMSU) and Colorado State University at Pueblo (CSU-P).

The web page for our previous Phase I NSF pilot grant, explaining our pedagogical goals, along with a list of available projects from that grant is at http://www.math.nmsu.edu/hist_projects.

Call for Site Testers

Any instructor of computer science or mathematics is invited to test any of our projects in the classroom for courses in discrete mathematics, combinatorics, graph theory, algorithm design, logic, abstract algebra, foundations of mathematics, or the history of mathematics. Please contact us if you are interested in participating.

List of projects we have been developing

1. Sums of numerical powers in discrete mathematics: Archimedes sums squares in the sand

2. Figurate numbers and sums of numerical powers: Fermat, Pascal, Bernoulli

3. Deduction through the Ages: A History of Truth

4a. Origins of Boolean Algebra in the Logic of Classes: George Boole, John Venn and C. S. Peirce

4b. Boolean Algebra as an Abstract Structure: Edward V. Huntington and Axiomatization

4c. Applications of Boolean Algebra: Claude Shannon and Circuit Design

5. Euclid's Algorithm for the Greatest Common Divisor

6. Algorithms, Recursion and Induction: Euclid and Fibonacci

7. Striving for efficiency in Algorithms: Sorting

8. Discovery of Huffman Codes

9. Networks and Spanning Trees

10. Project on Program Correctness

11. Abstract awakenings in algebra: Early group theory in the works of Lagrange, Cauchy, and Cayley

12. Regular languages and Finite Automata

13. Henkin's Method and the Completeness Theorem

14. Peano Arithmetic

15. Godel's inCompleteness Theorem

16. Undecidability of First-Order Logic

17. An Introduction to Sets and Infinity via Richard Dedekind

   References for the projects.

 

Sponsors
This material is based upon work supported in part by the National Science Foundation under Grants No. 0715392 and 0717752. Disclaimer: Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.