Abstract : It has been well-known since foundational work of Hochman and Meyerovitch that that the topological entropy of a multidimensional shift of finite type may have no closed form, and in fact may even be noncomputable. For this reason, it is worthwhile to find provable approximation schemes for the entropy/pressure of "well-behaved" multidimensional models. I will describe some results guaranteeing such approximability schemes, ranging from general results requiring only mixing con-ditions on the underlying SFT to specific results tailored to individual models, and will outline some of the ways in which such results can be proven.

Keywords : Entropy; computability