You are welcome to Automata Theory and  Computability.  This is the foundation, fundamental, and perhaps the canonical, subject in computing. The subject matter of this course permeates the entire field of computing. This is because the roots of the tree, from which the fundamental concept of the principles and theories underlying all computing instruments and artefacts emerges, are grounded in subject matter of this course. Specifically, the concepts and principles that we shall be considering in this course are key to the conceptualisation, formulation, design, implementation and evaluation of ideal and abstract computing processes or systems: from the very simple to the most complex. In this course, therefore, we will be examining some fundamental theoretical and
practical interpretations of the concepts underpinning computing. We shall, first of all, demonstrate that the purpose of computing is problem-solving.

Then we shall be discussing the set of criteria, theories and principles that are key to determining:

  1. What can be conceptually computed?
  2. How computed concepts be precisely and completely expressed?
  3. To what extent can  computable concepts be realised materially?