PARS-tutorial-ex5 < Main

Exercise: Write a recursive process that (a) never terminates and (b) terminates after 1 iteration of its body.

T<n> = EQ<n,n> ; T<n> . 

Since n=n always, this will recursive forever.

T<n> = NEQ<n,n> ; T<n>  .

Since n!=n is never true, this will stop after one iteration of the body, which in this case is just the NEQ process.

-- (c) Fordham University Robotics and Computer Vision

This topic: Main > WebHome > FordhamRoboticsAndComputerVisionLaboratory > FRCVProjects > DTRA > PARS-tutorial > PARS-tutorial-ex5
Topic revision: r1 - 2014-09-12 - DamianLyons