Theory of Computation This course explores the nature of computation and what it means to compute. We study important models of computation (finite automata, push-down automata, and Turing machines) and investigate their fundamental computational power. We examine various problems and try to determine the computational power needed to solve them. Topics include deterministic versus non-deterministic computation, and a theoretical basis for the study of NP-completeness.

Writing Rivers In this class we will read and write about rivers, as well as streams, brooks, and creeks, considering the ecology of rivers, rivers as metaphors, rivers in literature, and rivers in our lives. Our readings will come from: the writings of scientists such as Kurt Fausch’s For the Love of River; works of philosophers such as Kathleen Dean Moore’s Riverwalking; and novels such as Norman Maclean’s A River Runs Through It.  As part of the class, we will take regular field trips to rivers and streams in the Middlebury area, especially in the nearby Green Mountain National Forest.

Computational Geometry Computational geometry involves the design and analysis of algorithms and data structures for the solution to problems of a geometric and computational nature. It is an old field, involving aspects of algorithms, geometry, combinatorics and probability, whose roots can be found in algorithmic questions posed by Euclid. Modern applications of computational geometry include geographic information systems, medical imaging, computer-aided design, and robotics. This course will explore some famous problems in computational geometry, including convex hulls, Voronoi diagrams, proximity problems, and triangulations.

Spatial Agent-Based Modeling In this course students will learn efficient data structures and design techniques for spatially-explicit agent-based modeling using the NetLogo programming language. Agent-based modeling techniques will be applied to problems in the social and natural sciences (such as graph pandemic modeling and population dynamics), mathematics and computational sciences (such as graph algorithms), and agent-based games. We will also explore some advanced programming features of NetLogo. We also discuss ethical aspects of computer simulation and how agent-based modeling might or might not fit in a framework of responsible computing.Students will design and implement a significant term software project. This course fulfills the Responsible Computing requirement for the Computer Science major.  (CSCI 0201).

Algorithms and Complexity This course focuses on the development of correct and efficient algorithmic solutions to computational problems, on the underlying data structures to support these algorithms, and on the social implications of algorithms. Topics include computational complexity, analysis of algorithms, proof of algorithm correctness, some advanced data structures, algorithmic techniques including greedy and dynamic programming, and the consequences of real-world applications of algorithms. The course complements the treatment of NP-completeness in CSCI 0301.

Mathematical Foundations of Computing In this course we will provide an introduction to the mathematical foundations of computer science, with an emphasis on formal reasoning. Topics will include propositional and predicate logic, sets, functions, and relations; basic number theory; mathematical induction and other proof methods; combinatorics, probability, and recurrence relations; graph theory; and models of computation.

Introduction to Programming through Simulation In this course we will introduce computer programming through the exploration and writing of computer simulations with applications to ecological sciences and social sciences. We will use NetLogo as a software/programming tool for developing agent-based simulations. Students will learn basic programming constructs such as variables, conditionals, loops, procedures, and recursion as well as tools for experimenting with computer simulations.  No prior experience in programming is expected or required. (not open to students who have taken CSCI 0145 or higher)

Data Structures In this course we will study the ideas and structures helpful in designing algorithms and writing programs for solving large, complex problems. The Java programming language and object-oriented paradigm are introduced in the context of important abstract data types (ADTs) such as stacks, queues, trees, and graphs. We will study efficient implementations of these ADTs, and learn classic algorithms to manipulate these structures for tasks such as sorting and searching. Prior programming experience is expected, but prior familiarity with the Java programming language is not assumed.

J.R.R. Tolkien's Middle-earth In this course we will explore the philology, philosophy, ecology, and theology of J.R.R.Tolkien as expressed in his Middle-earth Legendarium.  We will begin with close readings of The Hobbit, The Lord of the Rings, and The Silmarillion, looking at the literary aspects of the storytelling and exploring important sources and influences including Beowulf and Norse mythology. We will then turn to the specific tasks of exploring the four subjects mentioned above, making use of secondary scholarship such as: Shippey’s J.R.R.Tolkien Author of the Century and Kreeft’s The Philosophy of J.R.R.Tolkien. Some emphasis will be given to Tolkien’s environmental vision.

Matthew Dickerson

Reviews and ratings for Matthew Dickerson at Middlebury College.Matthew Dickerson teaches Theory of Computation, Writing Rivers, Computational Geometry and more.  Explore top rated instructors and find the best for you.Is Matthew Dickerson good ? Find out on MiddCourses.

First class with Prof Dickerson and I really enjoyed the class. Not sure why the class has such a bad rep to be honest. At times it can feel abstract, but a lot of the problem solving is pretty fun. I would take a class with Prof. Dickerson again

Dickerson was a fair and understanding professor. We would read around a chapter for each class, then spend class discussing the book and the strengths of the author. There were three essays distributed through the semester. He had useful tips for writing, thought I found many of the readings to be boring.

Prof. Dickerson is a nice professor, and the course material is of course in his expertise. The course covers a wide range of algorithms, and you get to implement each one through coding assignments. It was a valuable experience that helped me develop my algorithmic intuition and programming skills. However, I would say the course is a bit loosely structured, and there is room to cover more material.