Programmable matter refers to any kind of matter that can algorithmically change its properties; such properties can include shape, color, size, etc. One futuristic vision of programmable matter is the T-1000 android from the terminator movies. One more concrete vision is matter that can change its shape so that it can be reused (in factories) instead of being thrown away or recycled. While all of that sounds nice, the field is still very young and our goal for this seminar is going to be more modest. In this seminar, we will focus on theoretical programmable matter models where the matter is represented by a graph embedded on a grid. Our goal is to investigate reconfiguration and computation problems on such graphs. The most basic problem in any programmable matter model is the following:” Given an initial shape A and a target graph B, compute a centralized or distributed algorithm that transforms shape A into shape B”.