COGS 2160 Lecture Notes - Lecture 12: Turing Machine, Connectionism, Default Rule

• School: York University
• Department: Cognitive Science
• Course: COGS 2160
• Professor: Jacob Beck

Document Summary

Physical symbol systems: physical symbol systems, discrete representations throughout, each stroke in a turing machine is a distinct representation, 0 and 1s in a digital computer. Formulae in a language of thought: task-specific rules (algorithms, machine tables for tms, write one program if you want it to add numbers, write a different program if you want it to subtract. If the(cid:374) rules i(cid:374) progra(cid:373) for digital computers: connectionist networks, representations are often missing altogether or distributed throughout the system. A case study: the english past tense: regular verbs, examples: walked, jogged, patted, kissed, predictable: verb + -ed, open-ended: faxed, snarfed, moshed, spammed, dissed, googled. It"s productive in children: wugged, bringed: they will over-generalize. Irregular verbs: examples: brought, hit, went, sang, slept, made, rang, flew, unpredictable: sink-sank, cling-clung, think-thought, blink-blinked, closed class: 165 irregulars and no recent new ones. A simple theory: default rule is to add -ed to the verb stem.