Extensions

MoMath's online gifted math program

Spring 2025

An Introduction to the Theory of Computation

May 18 through June 29
Sundays, 1:00 pm to 2:30 pm ET

(online)

Incredibly, mathematics can actually establish limits on mathematical knowledge. In this course, we'll explore a few problems that we can prove are “undecidable” (i.e., problems for which there can be no general method to solve them)!

Even in recreational mathematics, such problems can appear.  We can ask whether or not a given polygon can be used to tessellate the plane, and, in many cases, we can determine the answer.  We can tell that a square does tessellate and that a pentagonal star does not.  The famous Hat tile can tessellate, but only aperiodically.  It remains open, though, whether there is a single general procedure to answer this question for all possible polygons in finite time.  It may be that this is impossible: It is known that there can never be any general procedure to determine whether or not a set of five or more shapes tessellates.

We will see how undecidability connects to the foundations of mathematical logic through the Theory of Computation, which addresses the nature of computation itself and what it can — and cannot — accomplish.

While this is much more a logic course than a computer course, in order to carry out some experiments, we will be playing with small Python scripts.  No previous coding knowledge required.

Online sessions will be held on Sundays, from 1:00 pm to 2:30 pm ET, on the following dates:

  • May 18
  • June 1
  • June 15
  • June 29

Materials needed:  Pencil, paper, access to online-python.com (or any Python coding environment), printed copy of course packet (to be sent in separate email).

When
May 18, 2025 1:00 pm to June 29, 2025 2:30 pm
Location
United States
Contact
Phone: (212) 542-0566
Event Fee(s)
Registration
Program fee $300.00