|Weak AI||Strong AI|
|Narrow application, scope is very limited||Widely applied, scope is vast|
|Good at specific tasks||Incredible human- level intelligence|
|Uses supervised and unsupervised learning||Uses clustering and association to process data.|
|Eg. Siri, Alexa||Ex. Advanced Robotics|
Artificial Intelligence is a field of computer science wherein the cognitive functions of human brain is studied and tried to be replicated on a machine/system. Artificial Intelligence is today widely used for various applications like computer vision, speech recognition, decision-making, perception, reasoning, cognitive capabilities and so on.
3. List some applications of AI.
Tower of Hanoi is a mathematical puzzle which shows how recursion might be utilized as a device in building up an algorithm to take care of a specific problem. Using decision tree and Breath first search algorithm(BFS) we can solve Tower of Hanoi using AI.
The Turing test is a method to test the machine’s ability to match the human level intelligence. A machine is used to challenge the human intelligence that when it passes the test, it is considered as intelligent. Yet a machine could be viewed as intelligent without sufficiently knowing about people to mimic a human.
An artificial intelligence program that has expert-level knowledge about a specific area and knows how to utilize its information to react appropriately. These systems have expertise to substitute a human expert. Their characteristics include –
A* is a computer algorithm that is extensively used for the purpose of finding the path or traversing a graph in order to find the most optimal route between the various points called as the nodes.
Go through the Wikipedia Artificial Intelligence to get clear understanding of Artificial Intelligence.
Start with the root node, then proceed through neighboring nodes. Further, moves towards next level of nodes. Till the arrangement is found, produces one tree at any given moment. As this pursuit can be executed utilizing FIFO(First in First Out) data structure. This strategy gives the shortest path to the solution.
11. What is Depth-First Search Algorithm?
Depth first search is based on LIFO (Last In First Out). A recursion is implemented with LIFO stack data structure. Thus, the nodes were different order than in BFS. The path is stored in each iteration from root to leaf node in linear with space requirement.
The search begins forward from the beginning state and in reverse from objective state. The search meets to identify a common state. The initial state way is linked with the objective state in reverse way. Each search is done just up to half of the aggregate way.
The repetitive search process of level 1, level 2 happens in this search. The search process continues till the solution is found. Nodes are generated till a single node is created. Stack of nodes are saved. The search ends once the solution is found.
The uniform cost search performs sorting in increasing cost of the path to a node. It expands the least cost node. It is identical to BFS if each iteration has same cost. It investigates ways in the expanding order of cost.
AI system uses game theory for enhancement, it requires more than one participant which narrows the field quite a bit. The two fundamental roles:
A search algorithm that tries to reduce the number of nodes that are searched by the minimax algorithm in the search tree. It can be applied to ‘n’ depth, prunes entire subtrees and leaves.
Fuzzy logic is the subset of AI, it is a way of encoding human learning for artificial processing. It is a form of many-valued logic. It is represented as IF-THEN rules.