AIM TUTORIAL - 01

1. There are 4 types of computation problems. They are:

Decision Problem
A problem that has only 2 possible possible
solutions e.g YES or No. Compare to other problems it is quite
straightforward.
Search (function) problem
It is used to answer the decision problem. It
is represented by binary. It is defined by a set of states, a start
state, a goal state, a boolean function that tells us whether a
given state is a goal state, a successor state function and line
a mapping from a state to set of new states. As for example :
Finding the path
Optimization Problem
It is used to finding the best possible
solution from all feasible solution. It is also a solution to an
optimization problem instance is a feasible solution that has
the minimal (or maximal) cost. As for example : Finding the
shortest path.
Counting Problem
It illustrates how many number of possible
solutions are there. As for example : Number of path.
2.

3.

Steps of Computational Complexity Theory: Get Sample Complexity

How many training examples to converge
into successful goal?
Computational Complexity
How much computational effort is need for
a learner to converge to successful goal?
Mistake Bound
How many training examples the learner
miss classify?
Difference between the Turing Test and a Turing Machine?
Turing test used to determine whether or not a computer
can think like a human brain.
Turing Machine is an idealised computing device
consisting of a read/write head (or scanner) with a paper tape
passing through it.

4. Quantifiers :
There are 4 types of quantifiers that are require for computational problems. They
are:
Size / complexity of hypothesis space.
Accuracy to which target concept must be approximated.
The probability that the learner will be output a successful
hypothesis.
The manner which examples of training are presented to the learner.
5.

Greedy Algorithm
Greedy algorithm is simple and much easier to
implement compared to other algorithm. It will find the shortest route
to reach the destinations. Greedy algorithms are used in mobile
networkings to route the packet much faster and efficiently to reach
its destination and to reduce delays.
6.
Simulated Annealing is a process where the temperature is reduced slowly,
starting from a random search at high temperature eventually becoming pure
greedy descent as it approaches zero temperature.
7.
Consider the formula ( a v b) /\ (-a v -c). Is this formula satisfiable? If so,
state the values of the variables to prove this.
a= T
b= T
c= F
8.
(mon v wed v thu) /\ (mon v tue v thu v fri) /\ (mon v tue v wed v thu) /\ (mon
v wed)
Monday everyone is available.