Tesar & Srnolensky's book is a valuable reference for traditional approaches to leamability within an Optimality Theory framework. It summarises the reflections of two of the 'founder members' of the discipline. However, other researchers have developed altemative algorithms based on the previous work presented in Tesar & Smolensky which, in our opinion, are more realisfic insofar as they can cope with variation and developmental instability (Boersrna & Hayes 2001). Another interesting question, which affects all computational approaches to leamability, is whether such theories are really grounded or not. Now we know that computers can actually work out the constraint ranking of a language starting frorn some (but not al]) initial hierarchi...