Article Preview
Top1. Introduction
Deep Learning (DL) is an advance tool of Machine Learning (ML) System that is a part of Artificial Intelligence (AI) in the domain of Computer Science (Deng & Yu, 2014). Each and every algorithm has been designed to solve some specific types of problem. The required time to solve a particular problem is denoted by its Time Complexity or more specifically we can say according to the verse of computer science, the Time Complexity defined as the time to execute a particular programme to solve a specific type of problem This is denoted by “big O notation,” (Gao & Xu, 2014). Analyzing the Time Complexity of problems we can classify all types of problems in two different categories, a polynomial time algorithm or P class problem that is denoted by O(p(n)) where p(n) is a polynomial function and another is none-deterministic polynomial time algorithm or NP class problem which take exponential time format to solve it (Garey & Johnson, 1990). Here we can say that if we develop a machine or technique that is capable of solving the NP type problem that can also solve P type problem, so P is a proper subset of NP that is P ⊆ NP (Meek, 2008). Now NP problems can also be converted into satisfiability problem that is solvable in polynomial time, this type of problem is called “hardest” problem in NP class, or we can say NP-Hard problem (Karp, 1972). Sometimes it is found that “hard” problem can also be solved as satisfiability problem, those are called NP-Complete problem. The Venn diagram of P, NP, NP-Complete and NP-Hard problem is shown in Figure 1.
Figure 1. P, NP, NP-Complete and NP-Hard problem
Artificial Intelligence (AI) the intelligence of machine by which we try to solve the problem belongs to the NP-Complete problem using probabilistic solution, sometimes it is also called AI-Complete (Yampolskiy, 2012). AI is mainly based on human thoughts and assumption that is further mechanized or we can say artificially designed. But the idea of AI or the journey of AI started many centuries ego. In Greek mythology Hephaestus and Pygmalion incorporated the idea of intelligent robots (such as Talos) and artificial beings (McCorduck, 2004). Aristotle; 384–322 BC described the deductive reasoning to come with a conclusion using logical arguments popularly known as Syllogism (McCorduck, 2004). The mechanical men created by Heron of Alexandria in first century (McCorduck, 2004). In 1206, Al-Jazari created a programmable, means a machine capable of taking instructions, orchestra of mechanical human beings shown in Figure 2 (Sarton, 1975).
Figure 2. Picture of the internal structure of an automaton for serving and arbitrating drinking sessions (Al-Hassani)
In 1962 the first digital calculating machine was designed by Blaise Pascal (McCorduck, 2004). In recent year Google Duplex has capable of to carry out natural conversations by mimicking human voice and also capable of calling, booking of appointment, scheduling a restaurant reservation by its own. No one can think about they are taking with some algorithms (Pierson, 2018). All these achievements are the successful result, from the day of thinking about Artificial Machineries. Now in modern days the AI is distributed in different domains and also have several task specific algorithms by its application like, Speech Recognition, Computer Vision, Image Processing, Object Recognition, Decision Support System, Knowledge Management, Data Mining, Language Identification, Natural Language Processing (NLP), ML, DL, Biologically Inspired Computing, Automatic Target Recognition, Evolutionary Robotics and so on.