[Webinar] Streamline your web hosting managementRegister Today

x
Solved

# Recursive theorm

Posted on 2011-10-20
Medium Priority
647 Views

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.

0
Question by:mustish1

LVL 27

Accepted Solution

d-glitch earned 2000 total points
ID: 37003383
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.
0

Author Closing Comment

ID: 37003405
Thanks
0

## Featured Post

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Finding a job can be stressful - searches, resume tweaks, and networking events can be super boring. Luckily we're here to help you land your dream job!
Originally published Entrepreneur.com Booming numbers of freelancing professionals are changing the face of work. In the United States alone last year, the number of workers freelancing grew from 700,000 to 54 million, according to a Freelancers’…
The Bounty Board allows you to request an article or video on any technical topic, or fulfill a bounty request to earn points. Watch this video to learn how to use the Bounty Board to get the content you want, earn points, and browse submitted bount…
Notifications on Experts Exchange help you keep track of your activity and updates in one place. Watch this video to learn how to use them on the site to quickly access the content that matters to you.
###### Suggested Courses
Course of the Month10 days, 3 hours left to enroll