Dear all, Upon inheriting the Looking Glass from our predecessors, we identified a number of key issues. Firstly, there were simply not enough articles being published, due both to a lack of submissions from the school community and limited responsiveness from the previous Academic Team. Secondly, the Looking Glass had not been advertised or explained effectively enough to the wider school community. As a result, we plan to implement a more consistent and engaging stream of articles on the Looking Glass. As part of this initiative, we are looking to recruit a select group of keen writers from across the lower school who would be willing to produce one high-quality piece of writing, discussion, or media each month for publication on the Looking Glass. We believe this will be hugely beneficial both to the school community, which will gain access to a wider range of opinions and viewpoints, and to prospective writers, who will be able to reference their experience contributing to the Look...
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...