FRIDAY
Nov. 1

12:30 - 13:00

Coffee / Registration

13:00 - 13:15

Opening Remarks

13:15 - 14:45

Session 1
Chair: Canaan Breiss


14:45 - 15:00

Break

15:00 - 16:30

Session 2
Chair: Jarry Chuang


16:30 - 16:45

Break

16:45 - 17:45

Plenary Session
Chair: Adam Jardine


Andrew LAMONT
University College London


Optimality Theory with lexical insertion is not computable

This talk examines the computational consequences of introducing lexical insertion, i.e., the ability to copy morphemes or insert them from the lexicon, as an operation into Optimality Theory. I demonstrate that this operation makes OT not computable: in other words, it is impossible to determine the output of a given input in a finite amount of time. This result is derived by modeling the Post Correspondence Problem in an OT grammar that uses only representations and mechanisms attested in the literature.