Difference: PARS-tutorial-ex5 ( vs. 1)

Line: 1 to 1

Added:

>
>

META TOPICPARENT	name="PARS-tutorial"

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

T = EQ<n,n> ; T .

Since n=n always, this will recursive forever.

T = NEQ<n,n> ; T .

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