REAL TIME APPLICATIONS OF COMPUTATIONAL THEORY, KPR Institute Engineering and Technology, Autonomous Engineering Institution, Coimbatore, India

The theory of computation (TOC) mainly comprises Computability Theory, Automata Theory, and Complexity Theory. Computability theory is the branch of the theory of computation that studies which problems are computationally solvable using different models of computation. A central question of computer science is to address the limits of computing devices by understanding the problems we can use computers to solve. Computability theory concerns what can be computed versus what cannot, and complexity concerns the resources required to compute the computable things. Automata theory deals with designing abstract computing devices to develop methods to describe and analyze the dynamic behaviour of discrete systems. It is an exciting, theoretical branch of computer science. The formality of automata theory can be applied to analysing and manipulating actual human language and developing human-computer interaction (HCI) and artificial intelligence (AI). It is a computer science branch which deals with how a problem can be solved efficiently by using an algorithm on a model of computation.
Applications of Theory of computation
1. Traffic lights.
2. Lifts and elevators.
3. Marketing.
4. Compilers.
5. Cloud computing.
Theory of Computation has helped in many fields such as Cryptography, Design and Analysis of Algorithms, Quantum Calculation, Logic within Computer Science, Computational Difficulty, Randomness within Calculation and Correcting Errors in Codes. The event was organized by course handling faculties of Theory of Computation to bring unite real-time applications to the course. TOC is a fully structured part of automata, regular expression, pumping lemma, closure properties, push-down automata, context-free grammar, and turning machine with NP hard and NP-Complete problems.