7/24/2019 AIMTUTORIAL-1

1/2

AIM TUTORIAL - 011. There are 4 types of computation problems. They are

!ecision "roblem A problem that has only # possible possible

solutions e.$ %&' or (o. )ompare to other problems it is *uitestrai$htfor+ar,. 'earch function problem

It is use, to ans+er the ,ecision problem. It

is represente, by binary. It is ,efine, by a set of states/ a start

state/ a $oal state/ a boolean function that tells us +hether a

$ien state is a $oal state/ a successor state function an, line

a mappin$ from a state to set of ne+ states. As for eample

2in,in$ the path Optimi3ation "roblem

It is use, to fin,in$ the best possiblesolution from all feasible solution. It is also a solution to an

optimi3ation problem instance is a feasible solution that has

the minimal or maimal cost. As for eample 2in,in$ the

shortest path.

)ountin$ "roblem It illustrates ho+ many number of possible

solutions are there. As for eample (umber of path.

#. 'teps of )omputational )ompleity Theory- et 'ample )ompleity

5o+ many trainin$ eamples to coner$e

into successful $oal6 )omputational )ompleity

5o+ much computational effort is nee, for

a learner to coner$e to successful $oal6 Mista7e 8oun,

5o+ many trainin$ eamples the learner

miss classify6

9. !ifference bet+een the Turin$ Test an, a Turin$ Machine6 Turin$ test use, to ,etermine +hether or not a computer

can thin7 li7e a human brain. Turin$ Machine is an i,ealise, computin$ ,eice

consistin$ of a rea,:+rite hea, or ;scanner

7/24/2019 AIMTUTORIAL-1

2/2

4. =uantifiers

There are 4 types of *uantifiers that are re*uire for computational problems. They

are

'i3e : compleity of hypothesis space. Accuracy to +hich tar$et concept must be approimate,.

The probability that the learner +ill be output a successfulhypothesis. The manner +hich eamples of trainin$ are presente, to the learner.

>. ree,y Al$orithm

? ree,y al$orithm is simple an, much easier to

implement compare, to other al$orithm. It +ill fin, the shortest route

to reach the ,estinations. ree,y al$orithms are use, in mobile

net+or7in$s to route the pac7et much faster an, efficiently to reach

its ,estination an, to re,uce ,elays.

@. 'imulate, Annealin$ is a process +here the temperature is re,uce, slo+ly/

startin$ from a ran,om search at hi$h temperature eentually becomin$ pure

$ree,y ,escent as it approaches 3ero temperature.

. )onsi,er the formula a b :B -a -c. Is this formula satisfiable6 If so/

state the alues of the ariables to proe this.

? aC T? bC T? cC 2

D. mon +e, thu :B mon tue thu fri :B mon tue +e, thu :B mon

+e,

Mon,ay eeryone is aailable.