Quantum Computing In this course we will explore how quantum mechanics can be applied to problems in communications, algorithms, detection, and cryptography. We will learn how features such as entanglement, superposition, and no-cloning can sometimes give quantum systems an advantage over standard “classical” computers. We will also discuss the current situation and challenges facing experimental quantum computers, as well as the limits of quantum computing. No previous experience with quantum mechanics is required. (MATH 0200 or CSCI 0200) 3 hrs lect./disc.

Transforming Traditions How do traditions transform when they expand beyond the time and place of their origin? In considering this question we will interrogate the value of authenticity, consider concerns of appropriation, and examine the impacts of new perspectives on existing practices. Course material (readings, videos, and recordings) will focus on the Korean percussion genres pungmul and samulnori. However, students will draw on their own traditions, interests, and experiences for discussions and assignments. Weekly in-class drumming practices will culminate in a performance at the end of the semester. No prior musical experience is needed but must have a willingness to bang vigorously on a drum in a group.

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.

Computational Complexity We will investigate the computational power of various resources. Examples include determining whether a computer with limited time or limited space can solve more difficult problems, attempting to characterize creativity as a resource, and comparing probabilistic and quantum computation. We will learn why we do not yet have answers to many of the most fundamental questions in computational complexity (like whether P=NP), and we will think critically about the value of studying these topics. Students enrolled in the College Writing (CW) section of the course will explore these ideas through writing, in particular, in three contexts that are critical for theoretical computer science: the proof (expert audience), the review paper (non-expert computer science audience), and the popular science article (educated public audience). (CSCI 0301).

Shelby Kimmel

Reviews and ratings for Shelby Kimmel at Middlebury College.Shelby Kimmel teaches Quantum Computing, Transforming Traditions, Algorithms and Complexity and more.  Explore top rated instructors and find the best for you.Is Shelby Kimmel good ? Find out on MiddCourses.

This class had a lot of things at many levels of hardship. It is really important that you not only pay attention in class but also make use of the office hours, since it gets harder and harder to remember things. But the problem sets are useful.

Professor Kimmel follows an objectives based grading system which is very forgiving and allows for reattempts on skills. Lectures are very foundational but often leave out a lot of intuition which usually needs to be supplemented with office hours or external learning in some manner.

This class was actually really fun. Lot's of interesting concepts and ways of thinking. Definitely more difficult conceptually than most other classes I've taken here, but the amount of work was not insane. The structure of the class really lends itself well to success in my opinion. Professor Kimmel was great as well!