Tarski's Finite Basis Problem is Undecidable

We exhibit a construction which produces for every Turing machine , an algebra (finite and of finite type) such that the Turing machine halts iff the algebra has a finite basis for its equations.