Combinatorial and Computational aspects of Tilings

In this talk, we will derive a proof that the periodic tiling problem is undecidable in the hyperbolic plane from the construction which we used to prove the undecidability of the tiling problem in the hyperbolic plane. We shall also look at another problem, regarding shortest paths between tiles in the pentagrid and in the heptagrid {7,3}.