This article placed third in the inaugural Fuller Research Prize competition 2021 HAMISH STARLING Even the least technical among us are familiar with programming languages in a loose sense: purposefully invented syntaxes constructed from keywords, symbols and identifiers used to tell a computer what to do. These confections power our modern world. From the operating system on which you are reading this article to the aeroplane which just passed overhead, most things are now controlled by code. So to fully comprehend the scope, characteristics and limitations of computers, it was realised in the 1950s that understanding the computational structures behind language was critical. In this piece I’ll discuss the Chomsky Hierarchy, a mathematical classification of languages into 4 types - regular, context-free, context-sensitive and recursively enumerable - explaining what each means. We’ll also discuss why this concept is relevant in the real world and how it links to “Automata”. Lang...
An Academic Blog for Watford Grammar School for Boys