🕑 1 min • 👤 Jeffrey Heinz • 📆 March 23, 2020 in Discussions • 🏷 math, logic, formal languages
Bill Idsardi brought this to my attention. Enjoy your reading!
Star-Free Regular Languages and Logic
on the Gödel’s Lost Letter and P=NP blog.
🕑 2 min • 👤 Jeffrey Heinz • 📆 April 21, 2019 in Discussions • 🏷 phonology, subregular, Stony Brook, IACS, photos
Yesterday at Stony Brook, we concluded an informal workshop on computational phonology, which focused on theoretical, logical, model-theoretic, and automata-theoretic aspects of phonology (and some syntax). Here ‘informal’ means the workshop itself has no advanced schedule of talks, nor are there any talks except for the co-located Linguistics Colloquium and Frontiers series talks. Instead we list topics we are interested in presenting and presenters lead discussion, utilizing the whiteboard and as much time as they want, or until the group becomes restless. We take breaks when we want, and have plenty of time to ask questions, talk with each other, and get to see what we are working on. Personally, I find it very refreshingly different from national and international conferences which (perhaps necessarily) come with a planned schedule of tighly-timed talks, Q&A and so on.
I wanted to take a moment to sumarize some of the big picture issues that emerged for me over the past couple of days.