Remarks and replies

In case you haven’t been following this virtual thread:

  1. Bill Idsardi‘s six-page paper “A simple proof that Optimality Theory is computationally intractable” appeared in the latest issue of LI (vol. 37, 271-275).
  2. AndrĂ¡s Kornai has a one-page reply (“Is OT NP-hard?”) on ROA.
  3. Idsardi has a three-page rejoinder (“Misplaced optimism”), also on ROA.
  4. Update: And another by Kornai (“Guarded optimism”).

This is exactly the sort of thing that should be happening on ROA (and, I would hope, also here on phonoloblog).

Leave a Reply

Your email address will not be published.