Recursive theorm

Posted on 2011-10-20
Last Modified: 2012-05-12
Hi guys: Can any one please help me in that question ?

Let K be the set of all cities that you can get to from Toronto by taking flights (or sequences of flights) on commercial airlines. Give a recursive definition of K.

Question by:mustish1
    LVL 26

    Accepted Solution

    This is a recursive definition for a set Z of ordered pairs:

    B. (2,4) is in Z.
    R1. If(x,y) is in Z with x < 10 and y <10, then (x+1, y+1) is in Z.
    R2. If(x,y) is in Z with x > 1 and y < 10, then(x-1, y+1) is in Z.


    This is a recursive definition for a set K of cities:

    B.    Toronto is in K.
    R1.  If there is ......  for city_k,  then city_k is in K.

    Author Closing Comment


    Featured Post

    Courses: Start Training Online With Pros, Today

    Brush up on the basics or master the advanced techniques required to earn essential industry certifications, with Courses. Enroll in a course and start learning today. Training topics range from Android App Dev to the Xen Virtualization Platform.

    Join & Write a Comment

    If you get continual lockouts after changing your Active Directory password, there are several possible reasons.  Two of the most common are using other devices to access your email and stored passwords in the credential manager of windows.
    With the shift in today’s hiring climate (, many companies are choosing to hire freelancers to get projects completed efficiently and inexpensively…
    Where to go on the main page to find the job listings. How to apply to a job that you are interested in from the list that is featured on our Careers page.
    Want to pick and choose which updates you receive? Feel free to check out this quick video on how to manage your email notifications.

    755 members asked questions and received personalized solutions in the past 7 days.

    Join the community of 500,000 technology professionals and ask your questions.

    Join & Ask a Question

    Need Help in Real-Time?

    Connect with top rated Experts

    22 Experts available now in Live!

    Get 1:1 Help Now