Skip to main content

Doug Baldwin

Professor Of Mathematics
South 307
245-5659
baldwin@geneseo.edu

Professor Baldwin has been a member of the Geneseo faculty since 1990. Originally holding a position in computer science, he joined the mathematics department in 2013.

My Complete CV

Office Hours

Any time Monday - Friday, 8:00 a.m.-5:00 p.m., unless I'm already committed to something. See my Google calendar for details of when I'm free.

Curriculum Vitae

Education

  • B.Sc., 1980, Yale University

  • M.Sc., 1981, Yale University

  • Ph.D., 1985, Yale University

Publications

  • Report of the SIGCSE Committee on Computing Education in Liberal Arts Colleges. Douglas Baldwin, Amanda Holland-Minkley, and Grant Braught, ACM Inroads, June 2019.

  • Can We "Flip" Non-Major Programming Courses Yet? Douglas Baldwin, Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

  • The Roles of Mathematics in Computer Science. Douglas Baldwin, Henry M. Walker, Peter B. Henderson, ACM Inroads, 2013

  • Is Computer Science a Relevant Academic Discipline for the 21st Century? Douglas Baldwin, IEEE Computer, 2011

  • Case Studies of Liberal Arts Computer Science Programs. Douglas Baldwin, Alyce Brady, Andrea Danyluk, Joel Adams, Andrea Lawrence, ACM Transactions on Computing Education, 2010

  • Surface Reconstruction from Constructive Solid Geometry for Interactive Visualization. Douglas Baldwin, Third International Symposium on Visual Computing (Springer: Lecture Notes in Computer Science 4841), 2007

  • SIGCSE Committee Report on the Implementation of a Discrete Mathematics Course. Bill Marion and Douglas Baldwin, 2007

  • Effectiveness of a Language Implementation Project in Building Appreciation for Formal Specification. Douglas Baldwin, Consortium for Computing Sciences in Colleges Northeastern Conference, 2007

  • Algorithms and Data Structures: The Science of Computing Douglas Baldwin and Greg Scragg, Charles River Media, 2004.

  • A Compiler for Teaching about Compilers. Doug Baldwin, Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

  • Discovery Learning in Computer Science. Douglas Baldwin, Proceedings of the Twenty-Seventh SIGCSE Technical Symposium on Computer Science Education, Mar. 1996.

Research Interests

My main research interests are in computer graphics, particularly procedural modelling of natural objects (e.g., terrains, plants, etc.) I am currently beginning a project aimed at studying what if any mathematical and algorithmic models can describe crystal aggregates in computer graphics. I also recently completed IViPP, a scientific visualization project in particle physics. Other interests include the role of mathematics in computer science, and programming languages and methods.

Classes

  • MATH 221: R/Calculus I

    Topics studied are limits and continuity; derivatives and antiderivatives of the algebraic, exponential, logarithmic, trigonometric, and inverse functions; the definite integral; and the fundamental theorem of the calculus. Prerequisites: MATH 112 or Precalculus with trigonometry or the equivalent. Offered every semester

  • MATH 230: Programming&MathProblemSolving

    This course serves as an introductory programming course for Mathematics majors. Basic programming techniques for solving problems typically encountered by mathematicians will be developed. The course covers basic procedural techniques such as algorithms, variables, input/output, data types, selection, iteration, functions and graphing. Good programming and commenting practices will be emphasized. The programming language for the course will be a mathematical programming language such as Matlab. Restricted to Math majors only. Corequisite/Prequisite: MATH 222. Offered every semester

  • MATH 304: Theory of Computability

    This course covers the theoretical limits on what algorithms can and cannot compute. Topics include finite automata, regular languages, push-down automata, context-free languages, Turing machines, decidability, the structure of the classes of computable and uncomputable problems, and the relationships between computability and the logical limits of mathematics. Prerequisites: MATH 239. Not offered on a regular basis.