Many definitions exist on Artificial Intelligence, Machine Learning and Algorithms. Hereby a brief overview of a couple of them.

**What does Wikipedia say? Artificial intelligence (AI), sometimes called machine intelligence, is intelligence demonstrated by machines, unlike the natural intelligence displayed by humans and animals. Leading AI textbooks define the field as the study of “intelligent agents“: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.[1] Colloquially, the term “artificial intelligence” is often used to describe machines (or computers) that mimic “cognitive” functions that humans associate with the human mind, such as “learning” and “problem solving”. Well to do some proper accounting we definitely need to mimic cognitive functions that humans***Definition of AI***Typically 4 types 1of AI are being defined:***Types of AI*- REACTIVE MACHINE
- LIMITED MEMORY
- THEORY OF MIND
- SELF-AWARENESS

- Recursive Algorithm
- Divide and Conquer Algorithm
- Dynamic Programming Algorithm
- Greedy Algorithm
- Brute Force Algorithm
- Backtracking Algorithm

*Definition of**an Algorith**m***According to Wikipedia: In mathematics and computer science, an***?***algorithm**is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or to perform a computation. Algorithms are always unambiguous and are used as specifications for performing calculations, data processing, automated reasoning, and other tasks.**Tens of types of algorithms can be found in the literature. The six most recognized2 ones are: 1. Recursive Algorithm This is one of the most interesting Algorithms as it calls itself with a smaller value as inputs which it gets after solving for the current inputs. In more simpler words, It’s an Algorithm that calls itself repeatedly until the problem is solved. This is not required for Accounting 2. Divide and Conquer Algorithm This is another effective way of solving many problems. In Divide and Conquer algorithms, divide the algorithm into two parts, the first parts divides the problem on hand into smaller subproblems of the same type. Then on the second part, these smaller problems are solved and then added together (combined) to produce the final solution of the problem. We don’t use this type of algorithm either 3. Dynamic Programming Algorithm These algorithms work by remembering the results of the past run and using them to find new results. In other words, dynamic programming algorithm solves complex problems by breaking it into multiple simple subproblems and then it solves each of them once and then stores them for future use. Fibonacci sequence is a good example for Dynamic Programming algorithms. 4. Greedy Algorithm These algorithms are used for solving optimization problems. In this algorithm, we find a locally optimum solution (without any regard for any consequence in future) and hope to find the optimal solution at the global level. The method does not guarantee that we will be able to find an optimal solution. The algorithm has 5 components:***Types of Algorithms*- The first one is a candidate set from which we try to find a solution.
- A selection function which helps choose the best possible candidate.
- A feasibility function which helps in deciding if the candidate can be used to find a solution.
- An objective function which assigns value to a possible solution or to a partial solution
- Solution function that tells when we have found a solution to the problem.