![]() |
![]() |
Computability and decidability. Computable and primitive recursive functions. The Halting Problem. Recursively enumerable sets. Relationships between languages, grammars, and machines. Solvable and unsolvable linguistic questions.
Prerequisites: CS600 or permission of instructor